About the Execution of LoLa+red for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 376.844 | 15137.00 | 29173.00 | 610.80 | FFFTFTFFFFTTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414200371.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-11b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414200371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 82K 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-11b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678323802621
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-11b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:03:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 01:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:03:26] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-09 01:03:26] [INFO ] Transformed 324 places.
[2023-03-09 01:03:26] [INFO ] Transformed 344 transitions.
[2023-03-09 01:03:26] [INFO ] Found NUPN structural information;
[2023-03-09 01:03:26] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 263 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 6 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 303 transition count 344
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 73 place count 251 transition count 292
Iterating global reduction 1 with 52 rules applied. Total rules applied 125 place count 251 transition count 292
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 137 place count 239 transition count 280
Iterating global reduction 1 with 12 rules applied. Total rules applied 149 place count 239 transition count 280
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 158 place count 230 transition count 271
Iterating global reduction 1 with 9 rules applied. Total rules applied 167 place count 230 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 176 place count 221 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 185 place count 221 transition count 262
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 193 place count 213 transition count 246
Iterating global reduction 1 with 8 rules applied. Total rules applied 201 place count 213 transition count 246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 209 place count 205 transition count 238
Iterating global reduction 1 with 8 rules applied. Total rules applied 217 place count 205 transition count 238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 225 place count 197 transition count 230
Iterating global reduction 1 with 8 rules applied. Total rules applied 233 place count 197 transition count 230
Applied a total of 233 rules in 135 ms. Remains 197 /324 variables (removed 127) and now considering 230/344 (removed 114) transitions.
// Phase 1: matrix 230 rows 197 cols
[2023-03-09 01:03:26] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-09 01:03:27] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-09 01:03:27] [INFO ] Invariant cache hit.
[2023-03-09 01:03:27] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-09 01:03:27] [INFO ] Invariant cache hit.
[2023-03-09 01:03:28] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/324 places, 230/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1318 ms. Remains : 197/324 places, 230/344 transitions.
Support contains 28 out of 197 places after structural reductions.
[2023-03-09 01:03:28] [INFO ] Flatten gal took : 89 ms
[2023-03-09 01:03:28] [INFO ] Flatten gal took : 40 ms
[2023-03-09 01:03:28] [INFO ] Input system was already deterministic with 230 transitions.
Finished random walk after 5634 steps, including 15 resets, run visited all 14 properties in 238 ms. (steps per millisecond=23 )
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 390 edges and 197 vertex of which 193 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 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 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Graph (complete) has 390 edges and 197 vertex of which 193 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 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 192 transition count 198
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 164 transition count 198
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 57 place count 164 transition count 166
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 121 place count 132 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 130 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 130 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 128 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 128 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 127 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 127 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 126 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 126 transition count 158
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 235 place count 75 transition count 107
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 245 place count 65 transition count 87
Iterating global reduction 2 with 10 rules applied. Total rules applied 255 place count 65 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 264 place count 56 transition count 78
Iterating global reduction 2 with 9 rules applied. Total rules applied 273 place count 56 transition count 78
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 282 place count 47 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 291 place count 47 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 300 place count 38 transition count 51
Iterating global reduction 2 with 9 rules applied. Total rules applied 309 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 30 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 30 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 22 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 344 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 349 place count 15 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 351 place count 13 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 351 place count 13 transition count 18
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 353 place count 12 transition count 18
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 355 place count 11 transition count 17
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 4 with 2 rules applied. Total rules applied 357 place count 10 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 359 place count 10 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 362 place count 7 transition count 12
Applied a total of 362 rules in 106 ms. Remains 7 /197 variables (removed 190) and now considering 12/230 (removed 218) transitions.
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2023-03-09 01:03:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 01:03:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-09 01:03:29] [INFO ] Invariant cache hit.
[2023-03-09 01:03:29] [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-09 01:03:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-09 01:03:29] [INFO ] Invariant cache hit.
[2023-03-09 01:03:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/197 places, 12/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 7/197 places, 12/230 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-00 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 8 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-00 finished in 555 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 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Graph (complete) has 390 edges and 197 vertex of which 193 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 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 192 transition count 199
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 199
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 55 place count 165 transition count 167
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 119 place count 133 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 131 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 131 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 129 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 129 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 128 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 128 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 127 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 127 transition count 159
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 231 place count 77 transition count 109
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 241 place count 67 transition count 89
Iterating global reduction 2 with 10 rules applied. Total rules applied 251 place count 67 transition count 89
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 261 place count 57 transition count 79
Iterating global reduction 2 with 10 rules applied. Total rules applied 271 place count 57 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 281 place count 47 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 291 place count 47 transition count 59
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 300 place count 38 transition count 50
Iterating global reduction 2 with 9 rules applied. Total rules applied 309 place count 38 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 30 transition count 34
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 30 transition count 34
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 332 place count 23 transition count 27
Iterating global reduction 2 with 7 rules applied. Total rules applied 339 place count 23 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 23 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 23 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 343 place count 21 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 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 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 347 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 15 transition count 20
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 350 place count 14 transition count 19
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 354 place count 12 transition count 21
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 358 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 10 transition count 15
Applied a total of 360 rules in 92 ms. Remains 10 /197 variables (removed 187) and now considering 15/230 (removed 215) transitions.
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-09 01:03:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:03:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-09 01:03:29] [INFO ] Invariant cache hit.
[2023-03-09 01:03:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-09 01:03:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:03:29] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2023-03-09 01:03:29] [INFO ] Invariant cache hit.
[2023-03-09 01:03:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/197 places, 15/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 10/197 places, 15/230 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-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 1) (OR (EQ s8 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 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-02 finished in 251 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((X(G((X(p0) U p1)))&&(G(p1) U p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 230
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 188 transition count 221
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 188 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 186 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 184 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 184 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 183 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 183 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 182 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 181 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 180 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 180 transition count 212
Applied a total of 33 rules in 52 ms. Remains 180 /197 variables (removed 17) and now considering 212/230 (removed 18) transitions.
// Phase 1: matrix 212 rows 180 cols
[2023-03-09 01:03:30] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-09 01:03:30] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 01:03:30] [INFO ] Invariant cache hit.
[2023-03-09 01:03:30] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-09 01:03:30] [INFO ] Invariant cache hit.
[2023-03-09 01:03:30] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/197 places, 212/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 180/197 places, 212/230 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s59 0) (EQ s88 1)), p0:(EQ s144 1)], nbAcceptance=1, 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 282 reset in 486 ms.
Stack based approach found an accepted trace after 799 steps with 2 reset with depth 102 and stack size 102 in 3 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-07 finished in 1341 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(F(p1))&&p0)))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 225
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 191 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 191 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 190 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 190 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 189 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 189 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 188 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 188 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 187 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 187 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 186 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 186 transition count 218
Applied a total of 22 rules in 40 ms. Remains 186 /197 variables (removed 11) and now considering 218/230 (removed 12) transitions.
// Phase 1: matrix 218 rows 186 cols
[2023-03-09 01:03:31] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:03:31] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-09 01:03:31] [INFO ] Invariant cache hit.
[2023-03-09 01:03:31] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-09 01:03:31] [INFO ] Invariant cache hit.
[2023-03-09 01:03:31] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/197 places, 218/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 186/197 places, 218/230 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s162 0) (EQ s63 1)), p1:(AND (EQ s141 0) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-08 finished in 874 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) U ((p1&&X(p1))||X(G(p1))))) U G(p2)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 191 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 191 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 189 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 189 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 187 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 187 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 186 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 186 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 185 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 185 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 184 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 184 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 183 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 183 transition count 215
Applied a total of 27 rules in 24 ms. Remains 183 /197 variables (removed 14) and now considering 215/230 (removed 15) transitions.
// Phase 1: matrix 215 rows 183 cols
[2023-03-09 01:03:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:03:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 01:03:32] [INFO ] Invariant cache hit.
[2023-03-09 01:03:32] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-09 01:03:32] [INFO ] Invariant cache hit.
[2023-03-09 01:03:32] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/197 places, 215/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 183/197 places, 215/230 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s145 0) (EQ s35 1)), p0:(OR (EQ s60 0) (EQ s107 1)), p1:(NEQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33242 reset in 308 ms.
Product exploration explored 100000 steps with 33258 reset in 328 ms.
Computed a total of 37 stabilizing places and 37 stable transitions
Graph (complete) has 368 edges and 183 vertex of which 182 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 37 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 1248 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (AND p2 (NOT p1)), true, (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 01:03:35] [INFO ] Invariant cache hit.
[2023-03-09 01:03:35] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 01:03:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 01:03:35] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 01:03:35] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 01:03:35] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 215/215 transitions.
Graph (complete) has 368 edges and 183 vertex of which 182 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 182 transition count 179
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 60 place count 158 transition count 179
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 60 place count 158 transition count 134
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 150 place count 113 transition count 134
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 226 place count 75 transition count 96
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 145 edges and 75 vertex of which 13 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.0 ms
Discarding 62 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 22 rules applied. Total rules applied 248 place count 13 transition count 75
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 311 place count 13 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 318 place count 10 transition count 7
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 322 place count 6 transition count 7
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 323 place count 6 transition count 7
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 324 place count 5 transition count 6
Iterating global reduction 6 with 1 rules applied. Total rules applied 325 place count 5 transition count 6
Applied a total of 325 rules in 40 ms. Remains 5 /183 variables (removed 178) and now considering 6/215 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 5/183 places, 6/215 transitions.
Finished random walk after 18 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p1)))
Knowledge based reduction with 18 factoid took 445 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-09 finished in 4032 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(((!p1 U (p2||G(!p1)))||p0)))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 230/230 transitions.
Graph (complete) has 390 edges and 197 vertex of which 194 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 193 transition count 201
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 167 transition count 201
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 53 place count 167 transition count 169
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 117 place count 135 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 133 transition count 166
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 133 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 132 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 132 transition count 165
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 217 place count 85 transition count 118
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 78 transition count 104
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 78 transition count 104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 71 transition count 97
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 71 transition count 97
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 64 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 64 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 57 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 57 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 279 place count 51 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 51 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 291 place count 45 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 297 place count 45 transition count 58
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 45 transition count 56
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 301 place count 45 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 43 transition count 54
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 50 edges and 41 vertex of which 38 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 314 place count 38 transition count 43
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 323 place count 30 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 29 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 324 place count 29 transition count 41
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 326 place count 28 transition count 41
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 336 place count 23 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 21 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 21 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 344 place count 19 transition count 31
Applied a total of 344 rules in 56 ms. Remains 19 /197 variables (removed 178) and now considering 31/230 (removed 199) transitions.
[2023-03-09 01:03:36] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 19 cols
[2023-03-09 01:03:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 01:03:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 01:03:36] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2023-03-09 01:03:36] [INFO ] Invariant cache hit.
[2023-03-09 01:03:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-09 01:03:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 01:03:36] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2023-03-09 01:03:36] [INFO ] Invariant cache hit.
[2023-03-09 01:03:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/197 places, 31/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 19/197 places, 31/230 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s7 0) (EQ s1 1)) (AND (EQ s11 0) (EQ s14 1)) (AND (EQ s17 0) (EQ s6 1))), p2:(AND (NOT (OR (EQ s6 0) (EQ s17 1))) (NOT (OR (EQ s14 0) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-14 finished in 330 ms.
All properties solved by simple procedures.
Total runtime 10236 ms.
ITS solved all properties within timeout
BK_STOP 1678323817758
--------------------
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
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-11b"
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-11b, 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-167819414200371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 '
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 ;