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-167819414300420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DiscoveryGPU-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678327218012

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-14b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:00:22] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-09 02:00:22] [INFO ] Transformed 408 places.
[2023-03-09 02:00:22] [INFO ] Transformed 434 transitions.
[2023-03-09 02:00:22] [INFO ] Found NUPN structural information;
[2023-03-09 02:00:22] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 95 place count 313 transition count 367
Iterating global reduction 1 with 67 rules applied. Total rules applied 162 place count 313 transition count 367
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 177 place count 298 transition count 352
Iterating global reduction 1 with 15 rules applied. Total rules applied 192 place count 298 transition count 352
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 205 place count 285 transition count 339
Iterating global reduction 1 with 13 rules applied. Total rules applied 218 place count 285 transition count 339
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 229 place count 274 transition count 328
Iterating global reduction 1 with 11 rules applied. Total rules applied 240 place count 274 transition count 328
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 249 place count 265 transition count 310
Iterating global reduction 1 with 9 rules applied. Total rules applied 258 place count 265 transition count 310
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 266 place count 257 transition count 302
Iterating global reduction 1 with 8 rules applied. Total rules applied 274 place count 257 transition count 302
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 280 place count 251 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 286 place count 251 transition count 296
Applied a total of 286 rules in 150 ms. Remains 251 /408 variables (removed 157) and now considering 296/434 (removed 138) transitions.
// Phase 1: matrix 296 rows 251 cols
[2023-03-09 02:00:22] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-09 02:00:23] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-09 02:00:23] [INFO ] Invariant cache hit.
[2023-03-09 02:00:23] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-09 02:00:23] [INFO ] Invariant cache hit.
[2023-03-09 02:00:23] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 251/408 places, 296/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1622 ms. Remains : 251/408 places, 296/434 transitions.
Support contains 28 out of 251 places after structural reductions.
[2023-03-09 02:00:24] [INFO ] Flatten gal took : 105 ms
[2023-03-09 02:00:24] [INFO ] Flatten gal took : 55 ms
[2023-03-09 02:00:24] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 25 out of 251 places (down from 28) after GAL structural reductions.
Finished random walk after 2130 steps, including 4 resets, run visited all 21 properties in 322 ms. (steps per millisecond=6 )
FORMULA DiscoveryGPU-PT-14b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 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))&&G(((G(p1)||X(F(p0))) U p2))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 248 transition count 253
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 208 transition count 253
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 81 place count 208 transition count 216
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 155 place count 171 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 167 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 167 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 163 place count 167 transition count 210
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 166 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 164 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 164 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 163 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 163 transition count 206
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 301 place count 98 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 312 place count 87 transition count 119
Iterating global reduction 2 with 11 rules applied. Total rules applied 323 place count 87 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 334 place count 76 transition count 108
Iterating global reduction 2 with 11 rules applied. Total rules applied 345 place count 76 transition count 108
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 356 place count 65 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 367 place count 65 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 378 place count 54 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 389 place count 54 transition count 75
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 44 transition count 55
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 44 transition count 55
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 419 place count 34 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 429 place count 34 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 32 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 31 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 433 place count 31 transition count 39
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 439 place count 28 transition count 39
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 3 with 6 rules applied. Total rules applied 445 place count 25 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 446 place count 25 transition count 35
Applied a total of 446 rules in 124 ms. Remains 25 /251 variables (removed 226) and now considering 35/296 (removed 261) transitions.
[2023-03-09 02:00:25] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 25 cols
[2023-03-09 02:00:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 02:00:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-09 02:00:25] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2023-03-09 02:00:25] [INFO ] Invariant cache hit.
[2023-03-09 02:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:00:25] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-09 02:00:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:00:25] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2023-03-09 02:00:25] [INFO ] Invariant cache hit.
[2023-03-09 02:00:25] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/251 places, 35/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 25/251 places, 35/296 transitions.
Stuttering acceptance computed with spot in 528 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s24 1)), p2:(EQ s16 1), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 178 steps with 0 reset in 10 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-00 finished in 985 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((G(p1)||p0))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 241 transition count 284
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 241 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 235 transition count 277
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 235 transition count 277
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 231 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 228 transition count 269
Applied a total of 46 rules in 66 ms. Remains 228 /251 variables (removed 23) and now considering 269/296 (removed 27) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-09 02:00:26] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:00:26] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 02:00:26] [INFO ] Invariant cache hit.
[2023-03-09 02:00:26] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-09 02:00:26] [INFO ] Invariant cache hit.
[2023-03-09 02:00:27] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/251 places, 269/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 228/251 places, 269/296 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-01 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:(EQ s16 1), p0:(OR (EQ s38 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1437 steps with 4 reset in 22 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-01 finished in 905 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)))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 233 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 233 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 229 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 229 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 227 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 227 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 226 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 226 transition count 267
Applied a total of 50 rules in 52 ms. Remains 226 /251 variables (removed 25) and now considering 267/296 (removed 29) transitions.
// Phase 1: matrix 267 rows 226 cols
[2023-03-09 02:00:27] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:00:27] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-09 02:00:27] [INFO ] Invariant cache hit.
[2023-03-09 02:00:27] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-09 02:00:27] [INFO ] Invariant cache hit.
[2023-03-09 02:00:28] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 267/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 862 ms. Remains : 226/251 places, 267/296 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s196 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-02 finished in 1007 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 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 248 transition count 254
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 209 transition count 254
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 79 place count 209 transition count 214
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 159 place count 169 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 165 place count 163 transition count 206
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 163 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 171 place count 163 transition count 205
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 173 place count 162 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 158 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 158 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 156 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 156 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 155 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 155 transition count 196
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 311 place count 93 transition count 134
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 323 place count 81 transition count 110
Iterating global reduction 2 with 12 rules applied. Total rules applied 335 place count 81 transition count 110
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 347 place count 69 transition count 98
Iterating global reduction 2 with 12 rules applied. Total rules applied 359 place count 69 transition count 98
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 371 place count 57 transition count 74
Iterating global reduction 2 with 12 rules applied. Total rules applied 383 place count 57 transition count 74
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 395 place count 45 transition count 62
Iterating global reduction 2 with 12 rules applied. Total rules applied 407 place count 45 transition count 62
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 419 place count 33 transition count 38
Iterating global reduction 2 with 12 rules applied. Total rules applied 431 place count 33 transition count 38
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 443 place count 21 transition count 26
Iterating global reduction 2 with 12 rules applied. Total rules applied 455 place count 21 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 456 place count 21 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 457 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 459 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 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 2 with 7 rules applied. Total rules applied 466 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 470 place count 10 transition count 16
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 474 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 475 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 477 place count 6 transition count 11
Applied a total of 477 rules in 124 ms. Remains 6 /251 variables (removed 245) and now considering 11/296 (removed 285) transitions.
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-09 02:00:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 02:00:28] [INFO ] Invariant cache hit.
[2023-03-09 02:00:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 02:00:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-09 02:00:28] [INFO ] Invariant cache hit.
[2023-03-09 02:00:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/251 places, 11/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 6/251 places, 11/296 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-04 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-04 finished in 296 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((F(p0)&&G(p1))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 248 transition count 255
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 210 transition count 255
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 77 place count 210 transition count 214
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 159 place count 169 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 164 transition count 207
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 164 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 161 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 160 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 160 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 159 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 159 transition count 201
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 305 place count 96 transition count 138
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 317 place count 84 transition count 114
Iterating global reduction 2 with 12 rules applied. Total rules applied 329 place count 84 transition count 114
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 341 place count 72 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 353 place count 72 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 365 place count 60 transition count 78
Iterating global reduction 2 with 12 rules applied. Total rules applied 377 place count 60 transition count 78
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 388 place count 49 transition count 67
Iterating global reduction 2 with 11 rules applied. Total rules applied 399 place count 49 transition count 67
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 410 place count 38 transition count 45
Iterating global reduction 2 with 11 rules applied. Total rules applied 421 place count 38 transition count 45
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 432 place count 27 transition count 34
Iterating global reduction 2 with 11 rules applied. Total rules applied 443 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 444 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 446 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 42 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 450 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 452 place count 21 transition count 29
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 454 place count 20 transition count 28
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 456 place count 19 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 459 place count 16 transition count 25
Applied a total of 459 rules in 126 ms. Remains 16 /251 variables (removed 235) and now considering 25/296 (removed 271) transitions.
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 16 cols
[2023-03-09 02:00:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 02:00:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-09 02:00:28] [INFO ] Invariant cache hit.
[2023-03-09 02:00:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-09 02:00:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:28] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-09 02:00:28] [INFO ] Invariant cache hit.
[2023-03-09 02:00:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/251 places, 25/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 16/251 places, 25/296 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s15 1)), p0:(AND (EQ s7 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-05 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(G(p1)))&&(p2 U p0)))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 240 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 240 transition count 283
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 236 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 236 transition count 278
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 232 transition count 273
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 229 transition count 270
Applied a total of 44 rules in 29 ms. Remains 229 /251 variables (removed 22) and now considering 270/296 (removed 26) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-09 02:00:29] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:00:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 02:00:29] [INFO ] Invariant cache hit.
[2023-03-09 02:00:29] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 02:00:29] [INFO ] Invariant cache hit.
[2023-03-09 02:00:29] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 270/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 229/251 places, 270/296 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s228 1), p2:(OR (NEQ s228 1) (EQ s131 1)), p1:(AND (EQ s80 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-07 finished in 1018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 248 transition count 255
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 210 transition count 255
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 77 place count 210 transition count 215
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 157 place count 170 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 164 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 164 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 164 transition count 206
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 171 place count 163 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 159 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 159 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 157 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 157 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 156 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 156 transition count 197
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 307 place count 95 transition count 136
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 319 place count 83 transition count 112
Iterating global reduction 2 with 12 rules applied. Total rules applied 331 place count 83 transition count 112
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 343 place count 71 transition count 100
Iterating global reduction 2 with 12 rules applied. Total rules applied 355 place count 71 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 366 place count 60 transition count 78
Iterating global reduction 2 with 11 rules applied. Total rules applied 377 place count 60 transition count 78
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 388 place count 49 transition count 67
Iterating global reduction 2 with 11 rules applied. Total rules applied 399 place count 49 transition count 67
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 410 place count 38 transition count 45
Iterating global reduction 2 with 11 rules applied. Total rules applied 421 place count 38 transition count 45
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 432 place count 27 transition count 34
Iterating global reduction 2 with 11 rules applied. Total rules applied 443 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 444 place count 27 transition count 33
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 446 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 448 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 27 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 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 455 place count 20 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 459 place count 16 transition count 24
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 467 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 471 place count 9 transition count 16
Applied a total of 471 rules in 64 ms. Remains 9 /251 variables (removed 242) and now considering 16/296 (removed 280) transitions.
[2023-03-09 02:00:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2023-03-09 02:00:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 02:00:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 02:00:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 02:00:30] [INFO ] Invariant cache hit.
[2023-03-09 02:00:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-09 02:00:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:00:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-09 02:00:30] [INFO ] Invariant cache hit.
[2023-03-09 02:00:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/251 places, 16/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 9/251 places, 16/296 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s7 1), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-08 finished in 388 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 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 234 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 234 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 231 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 231 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 229 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 229 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 228 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 228 transition count 270
Applied a total of 46 rules in 25 ms. Remains 228 /251 variables (removed 23) and now considering 270/296 (removed 26) transitions.
// Phase 1: matrix 270 rows 228 cols
[2023-03-09 02:00:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 02:00:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-09 02:00:30] [INFO ] Invariant cache hit.
[2023-03-09 02:00:30] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-09 02:00:30] [INFO ] Invariant cache hit.
[2023-03-09 02:00:31] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/251 places, 270/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 228/251 places, 270/296 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s8 0) (OR (EQ s109 0) (EQ s224 0))), p0:(EQ s192 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 34 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-09 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 281
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 232 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 232 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 228 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 228 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 226 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 226 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 225 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 225 transition count 266
Applied a total of 52 rules in 31 ms. Remains 225 /251 variables (removed 26) and now considering 266/296 (removed 30) transitions.
// Phase 1: matrix 266 rows 225 cols
[2023-03-09 02:00:31] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 02:00:31] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-09 02:00:31] [INFO ] Invariant cache hit.
[2023-03-09 02:00:32] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-09 02:00:32] [INFO ] Invariant cache hit.
[2023-03-09 02:00:32] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/251 places, 266/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 225/251 places, 266/296 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s86 1) (EQ s224 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 481 reset in 600 ms.
Stack based approach found an accepted trace after 376 steps with 1 reset with depth 257 and stack size 257 in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-10 finished in 1563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U X((X(F(p1))&&p2))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 240 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 240 transition count 283
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 234 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 234 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 230 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 228 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 228 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 227 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 227 transition count 268
Applied a total of 48 rules in 16 ms. Remains 227 /251 variables (removed 24) and now considering 268/296 (removed 28) transitions.
// Phase 1: matrix 268 rows 227 cols
[2023-03-09 02:00:33] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 02:00:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 02:00:33] [INFO ] Invariant cache hit.
[2023-03-09 02:00:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 02:00:33] [INFO ] Invariant cache hit.
[2023-03-09 02:00:33] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/251 places, 268/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 227/251 places, 268/296 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s69 1), p1:(EQ s26 1), p2:(AND (EQ s110 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 695 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-11 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 296/296 transitions.
Graph (complete) has 499 edges and 251 vertex of which 249 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 248 transition count 253
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 208 transition count 253
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 81 place count 208 transition count 214
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 159 place count 169 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 164 transition count 207
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 164 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 164 transition count 206
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 171 place count 163 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 160 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 160 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 159 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 159 transition count 201
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 307 place count 95 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 319 place count 83 transition count 113
Iterating global reduction 2 with 12 rules applied. Total rules applied 331 place count 83 transition count 113
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 343 place count 71 transition count 101
Iterating global reduction 2 with 12 rules applied. Total rules applied 355 place count 71 transition count 101
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 367 place count 59 transition count 77
Iterating global reduction 2 with 12 rules applied. Total rules applied 379 place count 59 transition count 77
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 391 place count 47 transition count 65
Iterating global reduction 2 with 12 rules applied. Total rules applied 403 place count 47 transition count 65
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 415 place count 35 transition count 41
Iterating global reduction 2 with 12 rules applied. Total rules applied 427 place count 35 transition count 41
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 439 place count 23 transition count 29
Iterating global reduction 2 with 12 rules applied. Total rules applied 451 place count 23 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 452 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 22 transition count 27
Applied a total of 453 rules in 50 ms. Remains 22 /251 variables (removed 229) and now considering 27/296 (removed 269) transitions.
[2023-03-09 02:00:33] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 22 cols
[2023-03-09 02:00:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 02:00:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 02:00:33] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2023-03-09 02:00:33] [INFO ] Invariant cache hit.
[2023-03-09 02:00:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-09 02:00:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/251 places, 27/296 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 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 18 transition count 24
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 2 with 4 rules applied. Total rules applied 10 place count 16 transition count 22
Applied a total of 10 rules in 5 ms. Remains 16 /21 variables (removed 5) and now considering 22/27 (removed 5) transitions.
[2023-03-09 02:00:34] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2023-03-09 02:00:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 02:00:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 02:00:34] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-09 02:00:34] [INFO ] Invariant cache hit.
[2023-03-09 02:00:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-09 02:00:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/251 places, 22/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 16/251 places, 22/296 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1), p1:(EQ s14 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 11 steps with 4 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-15 finished in 400 ms.
All properties solved by simple procedures.
Total runtime 12482 ms.
ITS solved all properties within timeout

BK_STOP 1678327235435

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-14b"
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-14b, 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-167819414300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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