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-167819414400436.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-15b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414400436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 13:30 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.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:31 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 111K 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-15b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678328599886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:23:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:23:22] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-09 02:23:22] [INFO ] Transformed 436 places.
[2023-03-09 02:23:22] [INFO ] Transformed 464 transitions.
[2023-03-09 02:23:22] [INFO ] Found NUPN structural information;
[2023-03-09 02:23:22] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 101 place count 335 transition count 393
Iterating global reduction 1 with 71 rules applied. Total rules applied 172 place count 335 transition count 393
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 186 place count 321 transition count 379
Iterating global reduction 1 with 14 rules applied. Total rules applied 200 place count 321 transition count 379
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 213 place count 308 transition count 366
Iterating global reduction 1 with 13 rules applied. Total rules applied 226 place count 308 transition count 366
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 238 place count 296 transition count 354
Iterating global reduction 1 with 12 rules applied. Total rules applied 250 place count 296 transition count 354
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 259 place count 287 transition count 336
Iterating global reduction 1 with 9 rules applied. Total rules applied 268 place count 287 transition count 336
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 277 place count 278 transition count 327
Iterating global reduction 1 with 9 rules applied. Total rules applied 286 place count 278 transition count 327
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 295 place count 269 transition count 318
Iterating global reduction 1 with 9 rules applied. Total rules applied 304 place count 269 transition count 318
Applied a total of 304 rules in 231 ms. Remains 269 /436 variables (removed 167) and now considering 318/464 (removed 146) transitions.
// Phase 1: matrix 318 rows 269 cols
[2023-03-09 02:23:23] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-09 02:23:23] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-09 02:23:23] [INFO ] Invariant cache hit.
[2023-03-09 02:23:24] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2023-03-09 02:23:24] [INFO ] Invariant cache hit.
[2023-03-09 02:23:24] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/436 places, 318/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1469 ms. Remains : 269/436 places, 318/464 transitions.
Support contains 28 out of 269 places after structural reductions.
[2023-03-09 02:23:24] [INFO ] Flatten gal took : 81 ms
[2023-03-09 02:23:24] [INFO ] Flatten gal took : 32 ms
[2023-03-09 02:23:24] [INFO ] Input system was already deterministic with 318 transitions.
Support contains 27 out of 269 places (down from 28) after GAL structural reductions.
Finished random walk after 4522 steps, including 8 resets, run visited all 25 properties in 320 ms. (steps per millisecond=14 )
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 258 transition count 306
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 258 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 252 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 252 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 247 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 247 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 244 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 244 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 243 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 243 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 242 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 242 transition count 286
Applied a total of 54 rules in 49 ms. Remains 242 /269 variables (removed 27) and now considering 286/318 (removed 32) transitions.
// Phase 1: matrix 286 rows 242 cols
[2023-03-09 02:23:25] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:23:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 02:23:25] [INFO ] Invariant cache hit.
[2023-03-09 02:23:26] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-09 02:23:26] [INFO ] Invariant cache hit.
[2023-03-09 02:23:26] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/269 places, 286/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 242/269 places, 286/318 transitions.
Stuttering acceptance computed with spot in 482 ms :[true, (AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (EQ s99 1) (NOT (AND (EQ s131 1) (EQ s241 1)))), p1:(AND (EQ s131 1) (EQ s241 1)), p0:(AND (OR (EQ s131 0) (EQ s241 0)) (OR (EQ s101 0) (EQ s241 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 13 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-00 finished in 1192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 267 transition count 273
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 224 transition count 273
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 87 place count 224 transition count 229
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 175 place count 180 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 174 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 174 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 187 place count 174 transition count 220
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 189 place count 173 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 170 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 170 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 169 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 169 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 168 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 168 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 333 place count 101 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 347 place count 87 transition count 120
Iterating global reduction 2 with 14 rules applied. Total rules applied 361 place count 87 transition count 120
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 375 place count 73 transition count 104
Iterating global reduction 2 with 14 rules applied. Total rules applied 389 place count 73 transition count 104
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 403 place count 59 transition count 77
Iterating global reduction 2 with 14 rules applied. Total rules applied 417 place count 59 transition count 77
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 431 place count 45 transition count 62
Iterating global reduction 2 with 14 rules applied. Total rules applied 445 place count 45 transition count 62
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 459 place count 31 transition count 35
Iterating global reduction 2 with 14 rules applied. Total rules applied 473 place count 31 transition count 35
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 486 place count 18 transition count 21
Iterating global reduction 2 with 13 rules applied. Total rules applied 499 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 501 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 503 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 504 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 15 transition count 17
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 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 12 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 513 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 515 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 517 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 518 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 519 place count 4 transition count 6
Applied a total of 519 rules in 143 ms. Remains 4 /269 variables (removed 265) and now considering 6/318 (removed 312) transitions.
[2023-03-09 02:23:26] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2023-03-09 02:23:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:23:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-09 02:23:27] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2023-03-09 02:23:27] [INFO ] Invariant cache hit.
[2023-03-09 02:23:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-09 02:23:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:27] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2023-03-09 02:23:27] [INFO ] Invariant cache hit.
[2023-03-09 02:23:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/269 places, 6/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 4/269 places, 6/318 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-01 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 259 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 259 transition count 307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 253 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 253 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 244 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 242 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 241 transition count 285
Applied a total of 56 rules in 49 ms. Remains 241 /269 variables (removed 28) and now considering 285/318 (removed 33) transitions.
// Phase 1: matrix 285 rows 241 cols
[2023-03-09 02:23:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 02:23:27] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-09 02:23:27] [INFO ] Invariant cache hit.
[2023-03-09 02:23:27] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-09 02:23:27] [INFO ] Invariant cache hit.
[2023-03-09 02:23:28] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 285/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 241/269 places, 285/318 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s237 1) (EQ s215 1)), p0:(EQ s237 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12484 reset in 355 ms.
Product exploration explored 100000 steps with 12549 reset in 410 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/241 stabilizing places and 48/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 137 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:23:30] [INFO ] Invariant cache hit.
[2023-03-09 02:23:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:30] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-09 02:23:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:23:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:31] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 14 ms to minimize.
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 3 ms to minimize.
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2023-03-09 02:23:31] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-09 02:23:32] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-09 02:23:33] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-09 02:23:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1988 ms
[2023-03-09 02:23:33] [INFO ] Computed and/alt/rep : 279/404/279 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-09 02:23:33] [INFO ] Added : 31 causal constraints over 7 iterations in 201 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 285/285 transitions.
Applied a total of 0 rules in 3 ms. Remains 241 /241 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-09 02:23:33] [INFO ] Invariant cache hit.
[2023-03-09 02:23:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 02:23:33] [INFO ] Invariant cache hit.
[2023-03-09 02:23:33] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-09 02:23:33] [INFO ] Invariant cache hit.
[2023-03-09 02:23:33] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 241/241 places, 285/285 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/241 stabilizing places and 48/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 71 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:23:34] [INFO ] Invariant cache hit.
[2023-03-09 02:23:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:35] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-09 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:23:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:35] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-09 02:23:36] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2023-03-09 02:23:37] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2023-03-09 02:23:38] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-09 02:23:38] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-09 02:23:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2329 ms
[2023-03-09 02:23:38] [INFO ] Computed and/alt/rep : 279/404/279 causal constraints (skipped 5 transitions) in 36 ms.
[2023-03-09 02:23:38] [INFO ] Added : 31 causal constraints over 7 iterations in 315 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 12540 reset in 256 ms.
Product exploration explored 100000 steps with 12533 reset in 360 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 285/285 transitions.
Graph (complete) has 490 edges and 241 vertex of which 240 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
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 240 transition count 284
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 31 place count 240 transition count 284
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 78 place count 240 transition count 284
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 112 place count 240 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 238 transition count 297
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 238 transition count 297
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 146 place count 238 transition count 357
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 160 place count 224 transition count 329
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 174 place count 224 transition count 329
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 216 place count 182 transition count 259
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 258 place count 182 transition count 259
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 300 place count 140 transition count 189
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 342 place count 140 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 356 place count 126 transition count 175
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 370 place count 126 transition count 175
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 397 place count 99 transition count 135
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 424 place count 99 transition count 135
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 476 place count 47 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 528 place count 47 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 532 place count 47 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 533 place count 46 transition count 52
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 534 place count 46 transition count 52
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 534 rules in 88 ms. Remains 46 /241 variables (removed 195) and now considering 52/285 (removed 233) transitions.
[2023-03-09 02:23:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:23:39] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 46 cols
[2023-03-09 02:23:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 02:23:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/241 places, 52/285 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 46/241 places, 52/285 transitions.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 285/285 transitions.
Applied a total of 0 rules in 11 ms. Remains 241 /241 variables (removed 0) and now considering 285/285 (removed 0) transitions.
// Phase 1: matrix 285 rows 241 cols
[2023-03-09 02:23:39] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:23:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 02:23:39] [INFO ] Invariant cache hit.
[2023-03-09 02:23:40] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-09 02:23:40] [INFO ] Invariant cache hit.
[2023-03-09 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 241/241 places, 285/285 transitions.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 13450 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 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 267 transition count 274
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 225 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 224 transition count 273
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 87 place count 224 transition count 229
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 175 place count 180 transition count 229
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 181 place count 174 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 174 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 187 place count 174 transition count 220
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 189 place count 173 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 170 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 170 transition count 217
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 169 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 169 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 168 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 168 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 333 place count 101 transition count 147
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 346 place count 88 transition count 122
Iterating global reduction 3 with 13 rules applied. Total rules applied 359 place count 88 transition count 122
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 372 place count 75 transition count 107
Iterating global reduction 3 with 13 rules applied. Total rules applied 385 place count 75 transition count 107
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 398 place count 62 transition count 82
Iterating global reduction 3 with 13 rules applied. Total rules applied 411 place count 62 transition count 82
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 424 place count 49 transition count 68
Iterating global reduction 3 with 13 rules applied. Total rules applied 437 place count 49 transition count 68
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 450 place count 36 transition count 43
Iterating global reduction 3 with 13 rules applied. Total rules applied 463 place count 36 transition count 43
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 476 place count 23 transition count 29
Iterating global reduction 3 with 13 rules applied. Total rules applied 489 place count 23 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 491 place count 21 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 493 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 494 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 495 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 498 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 505 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 509 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 513 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 516 place count 5 transition count 10
Applied a total of 516 rules in 107 ms. Remains 5 /269 variables (removed 264) and now considering 10/318 (removed 308) transitions.
[2023-03-09 02:23:40] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 02:23:40] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:23:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 02:23:40] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 02:23:40] [INFO ] Invariant cache hit.
[2023-03-09 02:23:40] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-09 02:23:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:40] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 02:23:40] [INFO ] Invariant cache hit.
[2023-03-09 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/269 places, 10/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 5/269 places, 10/318 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-03 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 s4 0)], 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 7 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-03 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1) U p2)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 259 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 259 transition count 307
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 254 transition count 300
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 254 transition count 300
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 250 transition count 295
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 250 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 247 transition count 292
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 247 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 246 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 246 transition count 291
Applied a total of 46 rules in 73 ms. Remains 246 /269 variables (removed 23) and now considering 291/318 (removed 27) transitions.
// Phase 1: matrix 291 rows 246 cols
[2023-03-09 02:23:41] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 02:23:41] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 02:23:41] [INFO ] Invariant cache hit.
[2023-03-09 02:23:41] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-09 02:23:41] [INFO ] Invariant cache hit.
[2023-03-09 02:23:41] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/269 places, 291/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 246/269 places, 291/318 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) 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 p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s110 1) (EQ s242 1)), p1:(NEQ s151 1), p0:(AND (EQ s180 1) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 247 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-04 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 267 transition count 273
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 224 transition count 273
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 87 place count 224 transition count 230
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 173 place count 181 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 175 transition count 222
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 175 transition count 222
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 175 transition count 221
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 187 place count 174 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 171 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 171 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 194 place count 170 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 195 place count 170 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 169 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 169 transition count 215
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 333 place count 101 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 347 place count 87 transition count 120
Iterating global reduction 2 with 14 rules applied. Total rules applied 361 place count 87 transition count 120
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 375 place count 73 transition count 104
Iterating global reduction 2 with 14 rules applied. Total rules applied 389 place count 73 transition count 104
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 402 place count 60 transition count 79
Iterating global reduction 2 with 13 rules applied. Total rules applied 415 place count 60 transition count 79
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 428 place count 47 transition count 65
Iterating global reduction 2 with 13 rules applied. Total rules applied 441 place count 47 transition count 65
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 454 place count 34 transition count 40
Iterating global reduction 2 with 13 rules applied. Total rules applied 467 place count 34 transition count 40
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 480 place count 21 transition count 26
Iterating global reduction 2 with 13 rules applied. Total rules applied 493 place count 21 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 495 place count 19 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 497 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 498 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 499 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 502 place count 16 transition count 19
Reduce places removed 1 places and 0 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 2 rules applied. Total rules applied 504 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 505 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 505 place count 14 transition count 16
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 509 place count 12 transition count 16
Applied a total of 509 rules in 56 ms. Remains 12 /269 variables (removed 257) and now considering 16/318 (removed 302) transitions.
[2023-03-09 02:23:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-09 02:23:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 02:23:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 02:23:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 02:23:41] [INFO ] Invariant cache hit.
[2023-03-09 02:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:23:41] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-09 02:23:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 02:23:41] [INFO ] Invariant cache hit.
[2023-03-09 02:23:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/269 places, 16/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 12/269 places, 16/318 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5296 reset in 190 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-05 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 267 transition count 274
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 225 transition count 274
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 85 place count 225 transition count 230
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 173 place count 181 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 176 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 176 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 183 place count 176 transition count 223
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 185 place count 175 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 173 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 173 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 172 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 172 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 171 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 171 transition count 218
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 329 place count 103 transition count 150
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 342 place count 90 transition count 125
Iterating global reduction 2 with 13 rules applied. Total rules applied 355 place count 90 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 368 place count 77 transition count 110
Iterating global reduction 2 with 13 rules applied. Total rules applied 381 place count 77 transition count 110
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 394 place count 64 transition count 85
Iterating global reduction 2 with 13 rules applied. Total rules applied 407 place count 64 transition count 85
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 420 place count 51 transition count 71
Iterating global reduction 2 with 13 rules applied. Total rules applied 433 place count 51 transition count 71
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 446 place count 38 transition count 46
Iterating global reduction 2 with 13 rules applied. Total rules applied 459 place count 38 transition count 46
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 472 place count 25 transition count 32
Iterating global reduction 2 with 13 rules applied. Total rules applied 485 place count 25 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 487 place count 23 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 490 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 491 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 492 place count 22 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 493 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 495 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 502 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 506 place count 11 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 512 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 6 transition count 11
Applied a total of 516 rules in 56 ms. Remains 6 /269 variables (removed 263) and now considering 11/318 (removed 307) transitions.
[2023-03-09 02:23:42] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-09 02:23:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:23:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 02:23:42] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 02:23:42] [INFO ] Invariant cache hit.
[2023-03-09 02:23:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 02:23:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:42] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 02:23:42] [INFO ] Invariant cache hit.
[2023-03-09 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/269 places, 11/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 6/269 places, 11/318 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-06 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (F(p2)&&p1)))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 258 transition count 306
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 258 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 252 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 252 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 247 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 247 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 243 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 243 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 241 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 240 transition count 284
Applied a total of 58 rules in 34 ms. Remains 240 /269 variables (removed 29) and now considering 284/318 (removed 34) transitions.
// Phase 1: matrix 284 rows 240 cols
[2023-03-09 02:23:42] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:23:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 02:23:42] [INFO ] Invariant cache hit.
[2023-03-09 02:23:42] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-09 02:23:42] [INFO ] Invariant cache hit.
[2023-03-09 02:23:43] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/269 places, 284/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 240/269 places, 284/318 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s91 1) (EQ s236 1)), p2:(AND (EQ s91 1) (EQ s236 1)), p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-08 finished in 857 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) U X(G((F(p1)&&(p2||X(G(p2))))))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 261 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 261 transition count 309
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 257 transition count 304
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 257 transition count 304
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 253 transition count 299
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 253 transition count 299
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 250 transition count 295
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 250 transition count 295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 248 transition count 293
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 248 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 247 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 247 transition count 292
Applied a total of 44 rules in 39 ms. Remains 247 /269 variables (removed 22) and now considering 292/318 (removed 26) transitions.
// Phase 1: matrix 292 rows 247 cols
[2023-03-09 02:23:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 02:23:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 02:23:43] [INFO ] Invariant cache hit.
[2023-03-09 02:23:43] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-09 02:23:43] [INFO ] Invariant cache hit.
[2023-03-09 02:23:44] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 247/269 places, 292/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 247/269 places, 292/318 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}, { cond=(NOT p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s178 1), p1:(EQ s179 1), p2:(NEQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 520 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-09 finished in 1168 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((G(F(p0)) U p1))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 267 transition count 274
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 225 transition count 274
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 85 place count 225 transition count 230
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 173 place count 181 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 176 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 176 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 183 place count 176 transition count 222
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 185 place count 175 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 173 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 173 transition count 220
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 325 place count 105 transition count 152
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 337 place count 93 transition count 129
Iterating global reduction 2 with 12 rules applied. Total rules applied 349 place count 93 transition count 129
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 361 place count 81 transition count 115
Iterating global reduction 2 with 12 rules applied. Total rules applied 373 place count 81 transition count 115
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 385 place count 69 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 397 place count 69 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 409 place count 57 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 421 place count 57 transition count 79
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 433 place count 45 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 445 place count 45 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 457 place count 33 transition count 43
Iterating global reduction 2 with 12 rules applied. Total rules applied 469 place count 33 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 471 place count 31 transition count 40
Iterating global reduction 2 with 2 rules applied. Total rules applied 473 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 30 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 30 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 476 place count 30 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 477 place count 30 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 479 place count 28 transition count 36
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 32 edges and 26 vertex of which 23 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 488 place count 23 transition count 27
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 494 place count 17 transition count 27
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 502 place count 13 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 12 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 505 place count 12 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 507 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 510 place count 9 transition count 17
Applied a total of 510 rules in 38 ms. Remains 9 /269 variables (removed 260) and now considering 17/318 (removed 301) transitions.
[2023-03-09 02:23:44] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2023-03-09 02:23:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 02:23:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 02:23:44] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2023-03-09 02:23:44] [INFO ] Invariant cache hit.
[2023-03-09 02:23:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-09 02:23:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:44] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2023-03-09 02:23:44] [INFO ] Invariant cache hit.
[2023-03-09 02:23:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/269 places, 17/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 9/269 places, 17/318 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s3 1), p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-11 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 259 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 259 transition count 307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 253 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 253 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 244 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 242 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 241 transition count 285
Applied a total of 56 rules in 40 ms. Remains 241 /269 variables (removed 28) and now considering 285/318 (removed 33) transitions.
// Phase 1: matrix 285 rows 241 cols
[2023-03-09 02:23:44] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:23:45] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-09 02:23:45] [INFO ] Invariant cache hit.
[2023-03-09 02:23:45] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-09 02:23:45] [INFO ] Invariant cache hit.
[2023-03-09 02:23:45] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 285/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 241/269 places, 285/318 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s219 1) (AND (EQ s100 1) (EQ s237 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 587 reset in 278 ms.
Stack based approach found an accepted trace after 253 steps with 1 reset with depth 134 and stack size 134 in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-13 finished in 1080 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 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 267 transition count 273
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 224 transition count 273
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 87 place count 224 transition count 229
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 175 place count 180 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 174 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 174 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 187 place count 174 transition count 220
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 189 place count 173 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 170 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 170 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 169 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 169 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 168 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 168 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 333 place count 101 transition count 147
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 346 place count 88 transition count 122
Iterating global reduction 2 with 13 rules applied. Total rules applied 359 place count 88 transition count 122
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 372 place count 75 transition count 107
Iterating global reduction 2 with 13 rules applied. Total rules applied 385 place count 75 transition count 107
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 398 place count 62 transition count 82
Iterating global reduction 2 with 13 rules applied. Total rules applied 411 place count 62 transition count 82
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 424 place count 49 transition count 68
Iterating global reduction 2 with 13 rules applied. Total rules applied 437 place count 49 transition count 68
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 450 place count 36 transition count 43
Iterating global reduction 2 with 13 rules applied. Total rules applied 463 place count 36 transition count 43
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 476 place count 23 transition count 29
Iterating global reduction 2 with 13 rules applied. Total rules applied 489 place count 23 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 491 place count 21 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 493 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 494 place count 20 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 498 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 505 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 509 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 513 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 514 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 5 transition count 10
Applied a total of 516 rules in 47 ms. Remains 5 /269 variables (removed 264) and now considering 10/318 (removed 308) transitions.
[2023-03-09 02:23:45] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 02:23:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:23:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 02:23:46] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 02:23:46] [INFO ] Invariant cache hit.
[2023-03-09 02:23:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-09 02:23:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:46] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 02:23:46] [INFO ] Invariant cache hit.
[2023-03-09 02:23:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/269 places, 10/318 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 5/269 places, 10/318 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-14 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 s4 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-15b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-14 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 259 transition count 308
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 259 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 254 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 254 transition count 301
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 250 transition count 296
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 250 transition count 296
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 246 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 246 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 244 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 243 transition count 288
Applied a total of 52 rules in 36 ms. Remains 243 /269 variables (removed 26) and now considering 288/318 (removed 30) transitions.
// Phase 1: matrix 288 rows 243 cols
[2023-03-09 02:23:46] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:23:46] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-09 02:23:46] [INFO ] Invariant cache hit.
[2023-03-09 02:23:46] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-09 02:23:46] [INFO ] Invariant cache hit.
[2023-03-09 02:23:47] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/269 places, 288/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1014 ms. Remains : 243/269 places, 288/318 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s137 1), p1:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-15 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-15b-LTLFireability-02
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 269/269 places, 318/318 transitions.
Graph (complete) has 538 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 267 transition count 275
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 226 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 274
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 85 place count 225 transition count 230
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 173 place count 181 transition count 230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 176 transition count 223
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 176 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 183 place count 176 transition count 222
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 175 transition count 222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 172 transition count 219
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 172 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 171 transition count 217
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 171 transition count 217
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 170 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 170 transition count 216
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 329 place count 103 transition count 149
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 343 place count 89 transition count 122
Iterating global reduction 3 with 14 rules applied. Total rules applied 357 place count 89 transition count 122
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 371 place count 75 transition count 106
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 75 transition count 106
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 399 place count 61 transition count 79
Iterating global reduction 3 with 14 rules applied. Total rules applied 413 place count 61 transition count 79
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 427 place count 47 transition count 64
Iterating global reduction 3 with 14 rules applied. Total rules applied 441 place count 47 transition count 64
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 454 place count 34 transition count 39
Iterating global reduction 3 with 13 rules applied. Total rules applied 467 place count 34 transition count 39
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 480 place count 21 transition count 25
Iterating global reduction 3 with 13 rules applied. Total rules applied 493 place count 21 transition count 25
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 495 place count 19 transition count 22
Iterating global reduction 3 with 2 rules applied. Total rules applied 497 place count 19 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 498 place count 18 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 499 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 503 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 505 place count 14 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 505 place count 14 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 509 place count 12 transition count 15
Applied a total of 509 rules in 66 ms. Remains 12 /269 variables (removed 257) and now considering 15/318 (removed 303) transitions.
[2023-03-09 02:23:47] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-09 02:23:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 02:23:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 02:23:47] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:47] [INFO ] Invariant cache hit.
[2023-03-09 02:23:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:23:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-09 02:23:47] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:47] [INFO ] Invariant cache hit.
[2023-03-09 02:23:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/269 places, 15/318 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 198 ms. Remains : 12/269 places, 15/318 transitions.
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s11 1) (EQ s8 1)), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/12 stabilizing places and 7/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 332 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 866 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:23:49] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:49] [INFO ] Invariant cache hit.
[2023-03-09 02:23:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-09 02:23:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:23:49] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-09 02:23:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:23:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 02:23:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-09 02:23:49] [INFO ] Computed and/alt/rep : 14/26/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 02:23:49] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-09 02:23:49] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:49] [INFO ] Invariant cache hit.
[2023-03-09 02:23:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 02:23:49] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:49] [INFO ] Invariant cache hit.
[2023-03-09 02:23:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:23:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-09 02:23:49] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:49] [INFO ] Invariant cache hit.
[2023-03-09 02:23:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 12/12 places, 15/15 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/12 stabilizing places and 7/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:23:51] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:51] [INFO ] Invariant cache hit.
[2023-03-09 02:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 02:23:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:23:51] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:23:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 02:23:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:23:51] [INFO ] Computed and/alt/rep : 14/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 02:23:51] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-09 02:23:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:23:51] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:51] [INFO ] Invariant cache hit.
[2023-03-09 02:23:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 12/12 places, 15/15 transitions.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-09 02:23:51] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:51] [INFO ] Invariant cache hit.
[2023-03-09 02:23:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 02:23:51] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:51] [INFO ] Invariant cache hit.
[2023-03-09 02:23:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:23:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-09 02:23:51] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-09 02:23:51] [INFO ] Invariant cache hit.
[2023-03-09 02:23:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 12/12 places, 15/15 transitions.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 4594 ms.
[2023-03-09 02:23:52] [INFO ] Flatten gal took : 35 ms
[2023-03-09 02:23:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 02:23:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 318 transitions and 853 arcs took 7 ms.
Total runtime 29546 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-15b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA DiscoveryGPU-PT-15b-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678328649618

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DiscoveryGPU-PT-15b-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-15b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 DiscoveryGPU-PT-15b-LTLFireability-02 247688 m, 49537 m/sec, 2080210 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-15b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 4/32 DiscoveryGPU-PT-15b-LTLFireability-02 478014 m, 46065 m/sec, 4235064 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-15b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 5/32 DiscoveryGPU-PT-15b-LTLFireability-02 657229 m, 35843 m/sec, 6447920 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for DiscoveryGPU-PT-15b-LTLFireability-02
lola: result : true
lola: markings : 688114
lola: fired transitions : 6946789
lola: time used : 16.000000
lola: memory pages used : 5
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-15b-LTLFireability-02: LTL true LTL model checker


Time elapsed: 16 secs. Pages in use: 5

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-15b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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