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.r135-smll-167819414000307.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 DiscoveryGPU-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414000307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 54K 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 DiscoveryGPU-PT-07b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678315134668

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:38:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 22:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:38:58] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-08 22:38:58] [INFO ] Transformed 212 places.
[2023-03-08 22:38:58] [INFO ] Transformed 224 transitions.
[2023-03-08 22:38:58] [INFO ] Found NUPN structural information;
[2023-03-08 22:38:58] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 200 transition count 224
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 41 place count 171 transition count 195
Iterating global reduction 1 with 29 rules applied. Total rules applied 70 place count 171 transition count 195
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 164 transition count 188
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 164 transition count 188
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 160 transition count 184
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 160 transition count 184
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 156 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 156 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 154 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 154 transition count 176
Applied a total of 104 rules in 82 ms. Remains 154 /212 variables (removed 58) and now considering 176/224 (removed 48) transitions.
// Phase 1: matrix 176 rows 154 cols
[2023-03-08 22:38:58] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-08 22:38:58] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-08 22:38:58] [INFO ] Invariant cache hit.
[2023-03-08 22:38:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-08 22:38:58] [INFO ] Invariant cache hit.
[2023-03-08 22:38:59] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/212 places, 176/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 154/212 places, 176/224 transitions.
Support contains 36 out of 154 places after structural reductions.
[2023-03-08 22:38:59] [INFO ] Flatten gal took : 54 ms
[2023-03-08 22:38:59] [INFO ] Flatten gal took : 25 ms
[2023-03-08 22:38:59] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 755 steps, including 3 resets, run visited all 19 properties in 126 ms. (steps per millisecond=5 )
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 293 edges and 154 vertex of which 149 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 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)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 293 edges and 154 vertex of which 149 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 148 transition count 144
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 120 transition count 144
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 57 place count 120 transition count 127
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 103 transition count 127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 95 transition count 117
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 95 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 107 place count 95 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 94 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 90 transition count 112
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 89 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 88 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 87 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 87 transition count 108
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 195 place count 51 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 201 place count 45 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 207 place count 45 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 213 place count 39 transition count 53
Iterating global reduction 2 with 6 rules applied. Total rules applied 219 place count 39 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 34 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 34 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 29 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 29 transition count 38
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 24 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 24 transition count 29
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 19 transition count 23
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 10 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 273 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 8 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 6 transition count 9
Applied a total of 277 rules in 90 ms. Remains 6 /154 variables (removed 148) and now considering 9/176 (removed 167) transitions.
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-08 22:39:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:39:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2023-03-08 22:39:00] [INFO ] Invariant cache hit.
[2023-03-08 22:39:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-08 22:39:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2023-03-08 22:39:00] [INFO ] Invariant cache hit.
[2023-03-08 22:39:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/154 places, 9/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 6/154 places, 9/176 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-01 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 293 edges and 154 vertex of which 149 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 148 transition count 145
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 121 transition count 145
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 121 transition count 128
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 104 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 97 transition count 119
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 97 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 103 place count 97 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 96 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 92 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 90 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 89 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 89 transition count 110
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 189 place count 54 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 49 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 49 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 44 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 44 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 39 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 39 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 34 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 34 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 233 place count 30 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 237 place count 30 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 241 place count 26 transition count 32
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 246 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 25 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 248 place count 25 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 25 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 258 place count 18 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 261 place count 15 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 261 place count 15 transition count 21
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 263 place count 14 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 265 place count 13 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
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 271 place count 10 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 10 transition count 20
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 10 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 8 transition count 15
Applied a total of 277 rules in 47 ms. Remains 8 /154 variables (removed 146) and now considering 15/176 (removed 161) transitions.
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 8 cols
[2023-03-08 22:39:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:39:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 22:39:00] [INFO ] Invariant cache hit.
[2023-03-08 22:39:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-08 22:39:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:39:00] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-08 22:39:00] [INFO ] Invariant cache hit.
[2023-03-08 22:39:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/154 places, 15/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 8/154 places, 15/176 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-02 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 (EQ s6 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-02 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 138 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 138 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 132 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 132 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 129 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 129 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 127 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 127 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 125 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 124 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 124 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 123 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 123 transition count 144
Applied a total of 60 rules in 31 ms. Remains 123 /154 variables (removed 31) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 123 cols
[2023-03-08 22:39:00] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 22:39:00] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 22:39:00] [INFO ] Invariant cache hit.
[2023-03-08 22:39:01] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 22:39:01] [INFO ] Invariant cache hit.
[2023-03-08 22:39:01] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/154 places, 144/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 123/154 places, 144/176 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s107 0) (EQ s41 1)), p1:(EQ s31 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-04 finished in 599 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||G(p1)||(p1&&F(G(p2)))))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 139 transition count 161
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 139 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 133 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 133 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 129 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 128 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 127 transition count 148
Applied a total of 52 rules in 17 ms. Remains 127 /154 variables (removed 27) and now considering 148/176 (removed 28) transitions.
// Phase 1: matrix 148 rows 127 cols
[2023-03-08 22:39:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 22:39:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 22:39:01] [INFO ] Invariant cache hit.
[2023-03-08 22:39:01] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-08 22:39:01] [INFO ] Invariant cache hit.
[2023-03-08 22:39:01] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/154 places, 148/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 127/154 places, 148/176 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s108 0) (EQ s68 1)), p1:(OR (EQ s58 0) (EQ s74 1)), p2:(OR (EQ s126 0) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1310 reset in 658 ms.
Product exploration explored 100000 steps with 1300 reset in 424 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 630 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 22:39:04] [INFO ] Invariant cache hit.
[2023-03-08 22:39:04] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 22:39:04] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:39:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
[2023-03-08 22:39:04] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-08 22:39:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 217 ms
[2023-03-08 22:39:04] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-08 22:39:04] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 616 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-08 22:39:05] [INFO ] Invariant cache hit.
[2023-03-08 22:39:05] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 22:39:05] [INFO ] Invariant cache hit.
[2023-03-08 22:39:05] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-08 22:39:05] [INFO ] Invariant cache hit.
[2023-03-08 22:39:06] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 127/127 places, 148/148 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 22:39:06] [INFO ] Invariant cache hit.
[2023-03-08 22:39:06] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:39:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 22:39:07] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:39:07] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-08 22:39:07] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
[2023-03-08 22:39:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 159 ms
[2023-03-08 22:39:07] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-08 22:39:07] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 557 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1288 reset in 239 ms.
Product exploration explored 100000 steps with 1312 reset in 246 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Graph (complete) has 252 edges and 127 vertex of which 126 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
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 126 transition count 147
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 14 place count 126 transition count 147
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 36 place count 126 transition count 147
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 55 place count 126 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 123 transition count 150
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 123 transition count 150
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 123 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 119 transition count 168
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 119 transition count 168
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 108 transition count 149
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 108 transition count 149
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 102 transition count 139
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 102 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 100 transition count 137
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 100 transition count 137
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 96 transition count 131
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 96 transition count 131
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 88 transition count 119
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 88 transition count 119
Deduced a syphon composed of 44 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 88 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 156 place count 84 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 160 place count 84 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 160 rules in 72 ms. Remains 84 /127 variables (removed 43) and now considering 107/148 (removed 41) transitions.
[2023-03-08 22:39:09] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 22:39:09] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
// Phase 1: matrix 102 rows 84 cols
[2023-03-08 22:39:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:39:09] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/127 places, 107/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 84/127 places, 107/148 transitions.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 127 cols
[2023-03-08 22:39:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:39:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 22:39:09] [INFO ] Invariant cache hit.
[2023-03-08 22:39:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-08 22:39:09] [INFO ] Invariant cache hit.
[2023-03-08 22:39:09] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 127/127 places, 148/148 transitions.
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 8250 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))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 139 transition count 160
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 139 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 132 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 132 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 128 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 128 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 126 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 126 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 124 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 124 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 123 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 123 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 122 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 122 transition count 141
Applied a total of 63 rules in 33 ms. Remains 122 /154 variables (removed 32) and now considering 141/176 (removed 35) transitions.
// Phase 1: matrix 141 rows 122 cols
[2023-03-08 22:39:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:39:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 22:39:09] [INFO ] Invariant cache hit.
[2023-03-08 22:39:09] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 22:39:09] [INFO ] Invariant cache hit.
[2023-03-08 22:39:10] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/154 places, 141/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 122/154 places, 141/176 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s63 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-07 finished in 494 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 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 293 edges and 154 vertex of which 151 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 150 transition count 148
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 125 transition count 148
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 51 place count 125 transition count 132
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 83 place count 109 transition count 132
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 103 transition count 124
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 103 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 95 place count 103 transition count 123
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 99 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 99 transition count 120
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 171 place count 65 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 62 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 62 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 180 place count 59 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 183 place count 59 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 186 place count 56 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 56 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 53 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 53 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 52 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 52 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 51 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 51 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 50 transition count 65
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 204 place count 50 transition count 62
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 50 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 48 transition count 60
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 56 edges and 46 vertex of which 43 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 13 rules applied. Total rules applied 221 place count 43 transition count 47
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 232 place count 33 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 32 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 233 place count 32 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 31 transition count 45
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 5 with 10 rules applied. Total rules applied 245 place count 26 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 25 transition count 41
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 25 transition count 37
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 255 place count 21 transition count 33
Applied a total of 255 rules in 55 ms. Remains 21 /154 variables (removed 133) and now considering 33/176 (removed 143) transitions.
[2023-03-08 22:39:10] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 21 cols
[2023-03-08 22:39:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:39:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 22:39:10] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2023-03-08 22:39:10] [INFO ] Invariant cache hit.
[2023-03-08 22:39:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-08 22:39:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:39:10] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
[2023-03-08 22:39:10] [INFO ] Invariant cache hit.
[2023-03-08 22:39:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/154 places, 33/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 21/154 places, 33/176 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-08 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 (OR (EQ s18 0) (EQ s10 1)) (OR (EQ s5 0) (EQ s3 1)) (OR (EQ s15 0) (EQ s7 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-08 finished in 202 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((p0&&X(F(p1))))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 140 transition count 162
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 140 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 134 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 134 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 131 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 131 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 130 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 130 transition count 152
Applied a total of 46 rules in 12 ms. Remains 130 /154 variables (removed 24) and now considering 152/176 (removed 24) transitions.
// Phase 1: matrix 152 rows 130 cols
[2023-03-08 22:39:10] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:39:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 22:39:10] [INFO ] Invariant cache hit.
[2023-03-08 22:39:10] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 22:39:10] [INFO ] Invariant cache hit.
[2023-03-08 22:39:10] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/154 places, 152/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 130/154 places, 152/176 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (EQ s29 0) (EQ s74 1)), p0:(OR (EQ s48 0) (EQ s92 1) (AND (EQ s43 0) (EQ s53 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 259 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 600 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 130 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-08 22:39:11] [INFO ] Invariant cache hit.
[2023-03-08 22:39:12] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 22:39:12] [INFO ] Invariant cache hit.
[2023-03-08 22:39:12] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-08 22:39:12] [INFO ] Invariant cache hit.
[2023-03-08 22:39:12] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 130/130 places, 152/152 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 259 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 556 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=185 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (complete) has 259 edges and 130 vertex of which 129 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
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 129 transition count 151
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 17 place count 129 transition count 151
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 128 transition count 150
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 127 transition count 149
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 127 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 126 transition count 147
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 125 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 125 transition count 146
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 125 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 122 transition count 150
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 122 transition count 150
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 87 place count 122 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 117 transition count 168
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 117 transition count 168
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 112 place count 102 transition count 143
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 127 place count 102 transition count 143
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 142 place count 87 transition count 118
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 157 place count 87 transition count 118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 162 place count 82 transition count 113
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 167 place count 82 transition count 113
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 176 place count 73 transition count 100
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 185 place count 73 transition count 100
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 201 place count 57 transition count 76
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 217 place count 57 transition count 76
Deduced a syphon composed of 32 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 223 place count 57 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 225 place count 55 transition count 68
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 227 place count 55 transition count 68
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 227 rules in 32 ms. Remains 55 /130 variables (removed 75) and now considering 68/152 (removed 84) transitions.
[2023-03-08 22:39:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:39:13] [INFO ] Flow matrix only has 65 transitions (discarded 3 similar events)
// Phase 1: matrix 65 rows 55 cols
[2023-03-08 22:39:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/130 places, 68/152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 55/130 places, 68/152 transitions.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 128 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 127 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 125 transition count 146
Applied a total of 10 rules in 9 ms. Remains 125 /130 variables (removed 5) and now considering 146/152 (removed 6) transitions.
// Phase 1: matrix 146 rows 125 cols
[2023-03-08 22:39:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:39:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 22:39:14] [INFO ] Invariant cache hit.
[2023-03-08 22:39:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-08 22:39:14] [INFO ] Invariant cache hit.
[2023-03-08 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 146/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 125/130 places, 146/152 transitions.
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-10 finished in 4109 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(X(!p1))) U X((p2||X(p2)))))'
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 140 transition count 162
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 140 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 134 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 134 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 130 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 130 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 128 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 126 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 126 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 125 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 125 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 124 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 124 transition count 144
Applied a total of 58 rules in 16 ms. Remains 124 /154 variables (removed 30) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 124 cols
[2023-03-08 22:39:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:39:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 22:39:14] [INFO ] Invariant cache hit.
[2023-03-08 22:39:14] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-08 22:39:14] [INFO ] Invariant cache hit.
[2023-03-08 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/154 places, 144/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 124/154 places, 144/176 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s65 1)), p2:(EQ s98 1), p1:(OR (EQ s114 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 759 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-12 finished in 752 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(p0)||G(!p1)||(!p1&&X(p2))))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 139 transition count 162
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 139 transition count 162
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 135 transition count 158
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 135 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 133 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 131 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 129 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 128 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 127 transition count 148
Applied a total of 52 rules in 14 ms. Remains 127 /154 variables (removed 27) and now considering 148/176 (removed 28) transitions.
// Phase 1: matrix 148 rows 127 cols
[2023-03-08 22:39:15] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:39:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 22:39:15] [INFO ] Invariant cache hit.
[2023-03-08 22:39:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-08 22:39:15] [INFO ] Invariant cache hit.
[2023-03-08 22:39:15] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/154 places, 148/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 127/154 places, 148/176 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s105 1)), p0:(EQ s31 1), p2:(NEQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4383 reset in 159 ms.
Stack based approach found an accepted trace after 919 steps with 40 reset with depth 25 and stack size 25 in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-13 finished in 731 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&&X(p1)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 138 transition count 160
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 138 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 131 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 131 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 127 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 125 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 125 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 123 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 122 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 121 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 121 transition count 141
Applied a total of 64 rules in 14 ms. Remains 121 /154 variables (removed 33) and now considering 141/176 (removed 35) transitions.
// Phase 1: matrix 141 rows 121 cols
[2023-03-08 22:39:15] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:39:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 22:39:16] [INFO ] Invariant cache hit.
[2023-03-08 22:39:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 22:39:16] [INFO ] Invariant cache hit.
[2023-03-08 22:39:16] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/154 places, 141/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 121/154 places, 141/176 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s41 0), p1:(OR (EQ s92 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33440 reset in 152 ms.
Product exploration explored 100000 steps with 33405 reset in 282 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 242 edges and 121 vertex of which 120 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/121 stabilizing places and 24/141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 407 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Finished random walk after 2133 steps, including 9 resets, run visited all 4 properties in 12 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 576 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Graph (complete) has 242 edges and 121 vertex of which 120 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 119 transition count 126
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 106 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 105 transition count 125
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 29 place count 105 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 77 place count 81 transition count 101
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 135 place count 52 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 141 place count 46 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 153 place count 40 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 159 place count 40 transition count 54
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 164 place count 35 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 174 place count 30 transition count 39
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 26 transition count 31
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 26 transition count 31
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 22 transition count 27
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 202 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 14 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 203 place count 14 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 11 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 212 place count 11 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 9 transition count 13
Applied a total of 214 rules in 22 ms. Remains 9 /121 variables (removed 112) and now considering 13/141 (removed 128) transitions.
[2023-03-08 22:39:18] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 9 cols
[2023-03-08 22:39:18] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:39:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 22:39:18] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2023-03-08 22:39:18] [INFO ] Invariant cache hit.
[2023-03-08 22:39:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-08 22:39:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:39:18] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2023-03-08 22:39:18] [INFO ] Invariant cache hit.
[2023-03-08 22:39:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/121 places, 13/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 9/121 places, 13/141 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/9 stabilizing places and 7/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 473 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Finished random walk after 48 steps, including 2 resets, run visited all 4 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 655 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-15 finished in 4575 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||G(p1)||(p1&&F(G(p2)))))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-07b-LTLCardinality-06
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 176/176 transitions.
Graph (complete) has 293 edges and 154 vertex of which 149 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 148 transition count 149
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 125 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 123 transition count 147
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 51 place count 123 transition count 130
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 85 place count 106 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 100 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 100 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 96 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 96 transition count 118
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 175 place count 61 transition count 83
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 57 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 57 transition count 75
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 54 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 54 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 52 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 50 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 50 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 48 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 48 transition count 62
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 46 transition count 59
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 46 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 45 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 45 transition count 58
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 45 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 43 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 68 edges and 42 vertex of which 41 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 216 place count 41 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 218 place count 39 transition count 53
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 5 with 12 rules applied. Total rules applied 230 place count 33 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 32 transition count 47
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 237 place count 27 transition count 42
Applied a total of 237 rules in 41 ms. Remains 27 /154 variables (removed 127) and now considering 42/176 (removed 134) transitions.
[2023-03-08 22:39:20] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 27 cols
[2023-03-08 22:39:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 22:39:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 22:39:20] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2023-03-08 22:39:20] [INFO ] Invariant cache hit.
[2023-03-08 22:39:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-08 22:39:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 22:39:20] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2023-03-08 22:39:20] [INFO ] Invariant cache hit.
[2023-03-08 22:39:20] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/154 places, 42/176 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 148 ms. Remains : 27/154 places, 42/176 transitions.
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s20 0) (EQ s12 1)), p1:(OR (EQ s9 0) (EQ s16 1)), p2:(OR (EQ s26 0) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14138 reset in 191 ms.
Product exploration explored 100000 steps with 13992 reset in 199 ms.
Computed a total of 20 stabilizing places and 27 stable transitions
Computed a total of 20 stabilizing places and 27 stable transitions
Detected a total of 20/27 stabilizing places and 27/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 605 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 279 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 22:39:22] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2023-03-08 22:39:22] [INFO ] Invariant cache hit.
[2023-03-08 22:39:22] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 22:39:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 22:39:22] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 22:39:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-08 22:39:22] [INFO ] After 6ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-08 22:39:22] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (AND (NOT p0) p2 p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p2) (G (NOT p2))))
Knowledge based reduction with 7 factoid took 496 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 2144 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-06 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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((p0&&X(F(p1))))))'
[2023-03-08 22:39:22] [INFO ] Flatten gal took : 14 ms
[2023-03-08 22:39:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 22:39:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 176 transitions and 467 arcs took 2 ms.
Total runtime 25081 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-07b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality

FORMULA DiscoveryGPU-PT-07b-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678315219292

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DiscoveryGPU-PT-07b-LTLCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 4/32 DiscoveryGPU-PT-07b-LTLCardinality-06 559343 m, 111868 m/sec, 2643138 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 8/32 DiscoveryGPU-PT-07b-LTLCardinality-06 1109488 m, 110029 m/sec, 5286802 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 11/32 DiscoveryGPU-PT-07b-LTLCardinality-06 1593399 m, 96782 m/sec, 7902253 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 14/32 DiscoveryGPU-PT-07b-LTLCardinality-06 2043561 m, 90032 m/sec, 10517317 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 17/32 DiscoveryGPU-PT-07b-LTLCardinality-06 2499805 m, 91248 m/sec, 13141661 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 20/32 DiscoveryGPU-PT-07b-LTLCardinality-06 2973391 m, 94717 m/sec, 15621109 t fired, .

Time elapsed: 30 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 23/32 DiscoveryGPU-PT-07b-LTLCardinality-06 3445042 m, 94330 m/sec, 18077671 t fired, .

Time elapsed: 35 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1800 27/32 DiscoveryGPU-PT-07b-LTLCardinality-06 3929617 m, 96915 m/sec, 20554043 t fired, .

Time elapsed: 40 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1800 29/32 DiscoveryGPU-PT-07b-LTLCardinality-06 4370870 m, 88250 m/sec, 23116841 t fired, .

Time elapsed: 45 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1800 32/32 DiscoveryGPU-PT-07b-LTLCardinality-06 4811430 m, 88112 m/sec, 25662124 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for DiscoveryGPU-PT-07b-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 DiscoveryGPU-PT-07b-LTLCardinality-10
lola: time limit : 3545 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DiscoveryGPU-PT-07b-LTLCardinality-10
lola: result : true
lola: markings : 11
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-07b-LTLCardinality-06: LTL unknown AGGR
DiscoveryGPU-PT-07b-LTLCardinality-10: LTL true LTL model checker


Time elapsed: 55 secs. Pages in use: 32

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="DiscoveryGPU-PT-07b"
export BK_EXAMINATION="LTLCardinality"
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 DiscoveryGPU-PT-07b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414000307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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