About the Execution of LoLa+red for DiscoveryGPU-PT-14b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 327.495 | 13077.00 | 26554.00 | 441.00 | FFFFFTTFFFFFFTFF | 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-167819414300419.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-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414300419
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 13:37 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.5K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:38 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 104K 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-14b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678327194543
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-14b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:59:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 01:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:59:57] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-09 01:59:57] [INFO ] Transformed 408 places.
[2023-03-09 01:59:57] [INFO ] Transformed 434 transitions.
[2023-03-09 01:59:57] [INFO ] Found NUPN structural information;
[2023-03-09 01:59:57] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 382 transition count 434
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 85 place count 323 transition count 375
Iterating global reduction 1 with 59 rules applied. Total rules applied 144 place count 323 transition count 375
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 157 place count 310 transition count 362
Iterating global reduction 1 with 13 rules applied. Total rules applied 170 place count 310 transition count 362
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 181 place count 299 transition count 351
Iterating global reduction 1 with 11 rules applied. Total rules applied 192 place count 299 transition count 351
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 198 place count 293 transition count 345
Iterating global reduction 1 with 6 rules applied. Total rules applied 204 place count 293 transition count 345
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 209 place count 288 transition count 335
Iterating global reduction 1 with 5 rules applied. Total rules applied 214 place count 288 transition count 335
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 219 place count 283 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 224 place count 283 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 229 place count 278 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 234 place count 278 transition count 325
Applied a total of 234 rules in 179 ms. Remains 278 /408 variables (removed 130) and now considering 325/434 (removed 109) transitions.
// Phase 1: matrix 325 rows 278 cols
[2023-03-09 01:59:58] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-09 01:59:58] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-09 01:59:58] [INFO ] Invariant cache hit.
[2023-03-09 01:59:59] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-09 01:59:59] [INFO ] Invariant cache hit.
[2023-03-09 01:59:59] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/408 places, 325/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 278/408 places, 325/434 transitions.
Support contains 34 out of 278 places after structural reductions.
[2023-03-09 01:59:59] [INFO ] Flatten gal took : 81 ms
[2023-03-09 01:59:59] [INFO ] Flatten gal took : 44 ms
[2023-03-09 02:00:00] [INFO ] Input system was already deterministic with 325 transitions.
Finished random walk after 5166 steps, including 11 resets, run visited all 22 properties in 358 ms. (steps per millisecond=14 )
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 546 edges and 278 vertex of which 270 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U G(p2))))'
Support contains 8 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 272 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 271 transition count 277
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 228 transition count 277
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 87 place count 228 transition count 238
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 165 place count 189 transition count 238
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 172 place count 182 transition count 231
Iterating global reduction 2 with 7 rules applied. Total rules applied 179 place count 182 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 182 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 181 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 176 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 176 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 172 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 172 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 170 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 170 transition count 214
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 327 place count 108 transition count 152
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 336 place count 99 transition count 135
Iterating global reduction 2 with 9 rules applied. Total rules applied 345 place count 99 transition count 135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 353 place count 91 transition count 126
Iterating global reduction 2 with 8 rules applied. Total rules applied 361 place count 91 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 369 place count 83 transition count 110
Iterating global reduction 2 with 8 rules applied. Total rules applied 377 place count 83 transition count 110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 385 place count 75 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 393 place count 75 transition count 102
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 400 place count 68 transition count 88
Iterating global reduction 2 with 7 rules applied. Total rules applied 407 place count 68 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 413 place count 62 transition count 82
Iterating global reduction 2 with 6 rules applied. Total rules applied 419 place count 62 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 421 place count 61 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 422 place count 60 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 60 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 424 place count 59 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 59 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 426 place count 58 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 58 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 428 place count 57 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 57 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 430 place count 56 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 56 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 432 place count 55 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 55 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 434 place count 54 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 435 place count 54 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 54 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 437 place count 53 transition count 70
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 91 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 442 place count 51 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 445 place count 48 transition count 66
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 471 place count 35 transition count 53
Applied a total of 471 rules in 117 ms. Remains 35 /278 variables (removed 243) and now considering 53/325 (removed 272) transitions.
[2023-03-09 02:00:00] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 35 cols
[2023-03-09 02:00:00] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 02:00:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 02:00:00] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2023-03-09 02:00:00] [INFO ] Invariant cache hit.
[2023-03-09 02:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:00:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-09 02:00:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2023-03-09 02:00:01] [INFO ] Invariant cache hit.
[2023-03-09 02:00:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/278 places, 53/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 35/278 places, 53/325 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s13 0) (EQ s1 1)), p1:(OR (EQ s34 0) (EQ s4 1) (EQ s15 0) (EQ s23 1)), p0:(OR (EQ s20 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-01 finished in 765 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)&&F(G(p1)))))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 270 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 269 transition count 276
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 227 transition count 276
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 85 place count 227 transition count 236
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 165 place count 187 transition count 236
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 181 transition count 230
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 181 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 177 place count 181 transition count 229
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 180 transition count 229
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 176 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 176 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 172 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 172 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 170 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 170 transition count 215
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 333 place count 103 transition count 148
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 344 place count 92 transition count 127
Iterating global reduction 2 with 11 rules applied. Total rules applied 355 place count 92 transition count 127
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 366 place count 81 transition count 114
Iterating global reduction 2 with 11 rules applied. Total rules applied 377 place count 81 transition count 114
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 388 place count 70 transition count 93
Iterating global reduction 2 with 11 rules applied. Total rules applied 399 place count 70 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 410 place count 59 transition count 81
Iterating global reduction 2 with 11 rules applied. Total rules applied 421 place count 59 transition count 81
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 430 place count 50 transition count 63
Iterating global reduction 2 with 9 rules applied. Total rules applied 439 place count 50 transition count 63
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 448 place count 41 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 457 place count 41 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 458 place count 40 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 459 place count 40 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 460 place count 39 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 39 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 462 place count 39 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 464 place count 39 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 466 place count 37 transition count 48
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 44 edges and 35 vertex of which 32 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 474 place count 32 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 479 place count 27 transition count 40
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 4 with 10 rules applied. Total rules applied 489 place count 22 transition count 35
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 493 place count 20 transition count 37
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 499 place count 20 transition count 31
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 503 place count 16 transition count 27
Applied a total of 503 rules in 85 ms. Remains 16 /278 variables (removed 262) and now considering 27/325 (removed 298) transitions.
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 16 cols
[2023-03-09 02:00:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2023-03-09 02:00:01] [INFO ] Invariant cache hit.
[2023-03-09 02:00:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-09 02:00:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2023-03-09 02:00:01] [INFO ] Invariant cache hit.
[2023-03-09 02:00:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/278 places, 27/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 16/278 places, 27/325 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s14 1)), p1:(AND (EQ s10 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-02 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 271 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 270 transition count 276
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 227 transition count 276
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 87 place count 227 transition count 236
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 167 place count 187 transition count 236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 180 transition count 229
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 180 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 181 place count 180 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 179 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 175 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 175 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 171 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 171 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 169 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 169 transition count 214
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 337 place count 102 transition count 147
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 348 place count 91 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 359 place count 91 transition count 126
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 370 place count 80 transition count 113
Iterating global reduction 2 with 11 rules applied. Total rules applied 381 place count 80 transition count 113
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 392 place count 69 transition count 92
Iterating global reduction 2 with 11 rules applied. Total rules applied 403 place count 69 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 414 place count 58 transition count 80
Iterating global reduction 2 with 11 rules applied. Total rules applied 425 place count 58 transition count 80
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 436 place count 47 transition count 59
Iterating global reduction 2 with 11 rules applied. Total rules applied 447 place count 47 transition count 59
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 458 place count 36 transition count 47
Iterating global reduction 2 with 11 rules applied. Total rules applied 469 place count 36 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 471 place count 34 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 473 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 33 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 477 place count 33 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 478 place count 33 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 31 transition count 39
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 34 edges and 29 vertex of which 26 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 491 place count 26 transition count 28
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 18 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 507 place count 14 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 14 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 511 place count 11 transition count 20
Applied a total of 511 rules in 63 ms. Remains 11 /278 variables (removed 267) and now considering 20/325 (removed 305) transitions.
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 11 cols
[2023-03-09 02:00:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2023-03-09 02:00:01] [INFO ] Invariant cache hit.
[2023-03-09 02:00:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-09 02:00:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:01] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2023-03-09 02:00:01] [INFO ] Invariant cache hit.
[2023-03-09 02:00:02] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/278 places, 20/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 11/278 places, 20/325 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 0), p1:(OR (EQ s5 0) (EQ s7 1)), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 60 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-03 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||G(p2))))))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 272 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 271 transition count 277
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 229 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 227 transition count 275
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 89 place count 227 transition count 235
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 169 place count 187 transition count 235
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 181 transition count 229
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 181 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 181 place count 181 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 180 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 187 place count 176 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 176 transition count 222
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 172 transition count 216
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 172 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 170 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 170 transition count 214
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 337 place count 103 transition count 147
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 348 place count 92 transition count 126
Iterating global reduction 3 with 11 rules applied. Total rules applied 359 place count 92 transition count 126
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 370 place count 81 transition count 113
Iterating global reduction 3 with 11 rules applied. Total rules applied 381 place count 81 transition count 113
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 391 place count 71 transition count 94
Iterating global reduction 3 with 10 rules applied. Total rules applied 401 place count 71 transition count 94
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 411 place count 61 transition count 83
Iterating global reduction 3 with 10 rules applied. Total rules applied 421 place count 61 transition count 83
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 430 place count 52 transition count 66
Iterating global reduction 3 with 9 rules applied. Total rules applied 439 place count 52 transition count 66
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 448 place count 43 transition count 56
Iterating global reduction 3 with 9 rules applied. Total rules applied 457 place count 43 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 459 place count 41 transition count 53
Iterating global reduction 3 with 2 rules applied. Total rules applied 461 place count 41 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 462 place count 40 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 40 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 464 place count 40 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 465 place count 40 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 467 place count 38 transition count 49
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 45 edges and 36 vertex of which 33 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 8 rules applied. Total rules applied 475 place count 33 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 480 place count 28 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 480 place count 28 transition count 40
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 482 place count 27 transition count 40
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 494 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 496 place count 20 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 500 place count 20 transition count 30
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 505 place count 15 transition count 25
Applied a total of 505 rules in 50 ms. Remains 15 /278 variables (removed 263) and now considering 25/325 (removed 300) transitions.
[2023-03-09 02:00:02] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-09 02:00:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 02:00:02] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
[2023-03-09 02:00:02] [INFO ] Invariant cache hit.
[2023-03-09 02:00:02] [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 02:00:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:02] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
[2023-03-09 02:00:02] [INFO ] Invariant cache hit.
[2023-03-09 02:00:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/278 places, 25/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 15/278 places, 25/325 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s6 1)), p1:(AND (EQ s13 0) (EQ s1 1)), p2:(AND (EQ s6 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-04 finished in 297 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' '!((((p0||G((X(p2)||p1))) U X((p3 U p0)))||F(p3)))'
Support contains 6 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 325
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 262 transition count 310
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 262 transition count 310
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 254 transition count 299
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 254 transition count 299
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 248 transition count 291
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 248 transition count 291
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 242 transition count 285
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 242 transition count 285
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 238 transition count 279
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 238 transition count 279
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 277
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 234 transition count 275
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 234 transition count 275
Applied a total of 87 rules in 41 ms. Remains 234 /278 variables (removed 44) and now considering 275/325 (removed 50) transitions.
// Phase 1: matrix 275 rows 234 cols
[2023-03-09 02:00:02] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:00:02] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 02:00:02] [INFO ] Invariant cache hit.
[2023-03-09 02:00:02] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-09 02:00:02] [INFO ] Invariant cache hit.
[2023-03-09 02:00:03] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/278 places, 275/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 234/278 places, 275/325 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s223 1), p1:(OR (EQ s125 0) (EQ s213 1)), p3:(EQ s20 1), p2:(OR (EQ s159 0) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3260 steps with 7 reset in 35 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-07 finished in 928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 270 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 269 transition count 274
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 225 transition count 274
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 89 place count 225 transition count 234
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 169 place count 185 transition count 234
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 177 place count 177 transition count 226
Iterating global reduction 2 with 8 rules applied. Total rules applied 185 place count 177 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 185 place count 177 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 176 transition count 225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 170 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 170 transition count 216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 164 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 164 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 214 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 217 place count 161 transition count 204
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 351 place count 94 transition count 137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 364 place count 81 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 377 place count 81 transition count 112
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 390 place count 68 transition count 97
Iterating global reduction 2 with 13 rules applied. Total rules applied 403 place count 68 transition count 97
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 415 place count 56 transition count 74
Iterating global reduction 2 with 12 rules applied. Total rules applied 427 place count 56 transition count 74
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 439 place count 44 transition count 61
Iterating global reduction 2 with 12 rules applied. Total rules applied 451 place count 44 transition count 61
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 463 place count 32 transition count 38
Iterating global reduction 2 with 12 rules applied. Total rules applied 475 place count 32 transition count 38
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 487 place count 20 transition count 25
Iterating global reduction 2 with 12 rules applied. Total rules applied 499 place count 20 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 501 place count 18 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 503 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 504 place count 17 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 17 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 15 transition count 18
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 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 512 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 513 place count 9 transition count 14
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 517 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 521 place count 5 transition count 8
Applied a total of 521 rules in 66 ms. Remains 5 /278 variables (removed 273) and now considering 8/325 (removed 317) transitions.
[2023-03-09 02:00:03] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2023-03-09 02:00:03] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 02:00:03] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2023-03-09 02:00:03] [INFO ] Invariant cache hit.
[2023-03-09 02:00:03] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 02:00:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:03] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2023-03-09 02:00:03] [INFO ] Invariant cache hit.
[2023-03-09 02:00:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/278 places, 8/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 5/278 places, 8/325 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-08 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 325
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 259 transition count 308
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 259 transition count 308
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 251 transition count 296
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 251 transition count 296
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 243 transition count 286
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 243 transition count 286
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 235 transition count 278
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 235 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 231 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 229 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 229 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 227 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 227 transition count 268
Applied a total of 100 rules in 54 ms. Remains 227 /278 variables (removed 51) and now considering 268/325 (removed 57) transitions.
// Phase 1: matrix 268 rows 227 cols
[2023-03-09 02:00:03] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:00:03] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 02:00:03] [INFO ] Invariant cache hit.
[2023-03-09 02:00:04] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-09 02:00:04] [INFO ] Invariant cache hit.
[2023-03-09 02:00:04] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/278 places, 268/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 227/278 places, 268/325 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s219 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1015 reset in 369 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-09 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p0 U (!p1||G(p0))))))))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 325
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 260 transition count 309
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 260 transition count 309
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 252 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 252 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 245 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 245 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 238 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 238 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 234 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 234 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 232 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 232 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 230 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 230 transition count 272
Applied a total of 94 rules in 39 ms. Remains 230 /278 variables (removed 48) and now considering 272/325 (removed 53) transitions.
// Phase 1: matrix 272 rows 230 cols
[2023-03-09 02:00:04] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 02:00:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 02:00:04] [INFO ] Invariant cache hit.
[2023-03-09 02:00:05] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-09 02:00:05] [INFO ] Invariant cache hit.
[2023-03-09 02:00:05] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/278 places, 272/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 230/278 places, 272/325 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s198 1)), p1:(OR (EQ s137 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 247 reset in 382 ms.
Stack based approach found an accepted trace after 71835 steps with 178 reset with depth 332 and stack size 332 in 273 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-10 finished in 1449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 325/325 transitions.
Graph (complete) has 546 edges and 278 vertex of which 270 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 269 transition count 277
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 228 transition count 277
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 83 place count 228 transition count 237
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 163 place count 188 transition count 237
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 180 transition count 229
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 180 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 180 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 179 transition count 228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 187 place count 173 transition count 219
Iterating global reduction 2 with 6 rules applied. Total rules applied 193 place count 173 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 199 place count 167 transition count 210
Iterating global reduction 2 with 6 rules applied. Total rules applied 205 place count 167 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 164 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 164 transition count 207
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 343 place count 98 transition count 141
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 356 place count 85 transition count 116
Iterating global reduction 2 with 13 rules applied. Total rules applied 369 place count 85 transition count 116
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 381 place count 73 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 393 place count 73 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 405 place count 61 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 417 place count 61 transition count 79
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 429 place count 49 transition count 66
Iterating global reduction 2 with 12 rules applied. Total rules applied 441 place count 49 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 451 place count 39 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 461 place count 39 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 471 place count 29 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 481 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 482 place count 28 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 483 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 484 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 27 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 486 place count 27 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 487 place count 27 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 27 edges and 23 vertex of which 20 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 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 494 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 496 place count 18 transition count 25
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 500 place count 16 transition count 23
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 504 place count 14 transition count 25
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 508 place count 14 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 511 place count 11 transition count 18
Applied a total of 511 rules in 46 ms. Remains 11 /278 variables (removed 267) and now considering 18/325 (removed 307) transitions.
[2023-03-09 02:00:06] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2023-03-09 02:00:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 02:00:06] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
[2023-03-09 02:00:06] [INFO ] Invariant cache hit.
[2023-03-09 02:00:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 02:00:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:06] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
[2023-03-09 02:00:06] [INFO ] Invariant cache hit.
[2023-03-09 02:00:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/278 places, 18/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 11/278 places, 18/325 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (EQ s9 0) (EQ s6 1)) (EQ s1 1)), p1:(OR (EQ s9 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-14 finished in 239 ms.
All properties solved by simple procedures.
Total runtime 9003 ms.
ITS solved all properties within timeout
BK_STOP 1678327207620
--------------------
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-14b"
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-14b, 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-167819414300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14b.tgz
mv DiscoveryGPU-PT-14b 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 ;