Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r153-tall-171631151600313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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 1716421562972

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:46:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:46:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:46:04] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-22 23:46:04] [INFO ] Transformed 408 places.
[2024-05-22 23:46:04] [INFO ] Transformed 434 transitions.
[2024-05-22 23:46:04] [INFO ] Found NUPN structural information;
[2024-05-22 23:46:04] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 93 place count 315 transition count 369
Iterating global reduction 1 with 65 rules applied. Total rules applied 158 place count 315 transition count 369
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 172 place count 301 transition count 355
Iterating global reduction 1 with 14 rules applied. Total rules applied 186 place count 301 transition count 355
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 197 place count 290 transition count 344
Iterating global reduction 1 with 11 rules applied. Total rules applied 208 place count 290 transition count 344
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 218 place count 280 transition count 334
Iterating global reduction 1 with 10 rules applied. Total rules applied 228 place count 280 transition count 334
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 237 place count 271 transition count 316
Iterating global reduction 1 with 9 rules applied. Total rules applied 246 place count 271 transition count 316
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 254 place count 263 transition count 308
Iterating global reduction 1 with 8 rules applied. Total rules applied 262 place count 263 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 269 place count 256 transition count 301
Iterating global reduction 1 with 7 rules applied. Total rules applied 276 place count 256 transition count 301
Applied a total of 276 rules in 184 ms. Remains 256 /408 variables (removed 152) and now considering 301/434 (removed 133) transitions.
// Phase 1: matrix 301 rows 256 cols
[2024-05-22 23:46:05] [INFO ] Computed 2 invariants in 22 ms
[2024-05-22 23:46:05] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 23:46:05] [INFO ] Invariant cache hit.
[2024-05-22 23:46:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-22 23:46:05] [INFO ] Invariant cache hit.
[2024-05-22 23:46:05] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/408 places, 301/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 785 ms. Remains : 256/408 places, 301/434 transitions.
Support contains 26 out of 256 places after structural reductions.
[2024-05-22 23:46:05] [INFO ] Flatten gal took : 46 ms
[2024-05-22 23:46:05] [INFO ] Flatten gal took : 18 ms
[2024-05-22 23:46:05] [INFO ] Input system was already deterministic with 301 transitions.
Support contains 25 out of 256 places (down from 26) after GAL structural reductions.
Finished random walk after 1998 steps, including 4 resets, run visited all 24 properties in 105 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 510 edges and 256 vertex of which 255 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1))&&X((p2&&G(!p0))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 245 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 245 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 242 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 242 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 240 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 240 transition count 284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 238 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 238 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 236 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 236 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 235 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 235 transition count 278
Applied a total of 42 rules in 39 ms. Remains 235 /256 variables (removed 21) and now considering 278/301 (removed 23) transitions.
// Phase 1: matrix 278 rows 235 cols
[2024-05-22 23:46:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:46:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 23:46:06] [INFO ] Invariant cache hit.
[2024-05-22 23:46:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-22 23:46:06] [INFO ] Invariant cache hit.
[2024-05-22 23:46:06] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/256 places, 278/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 235/256 places, 278/301 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s211 1) (EQ s231 1)), p0:(NEQ s166 1), p2:(EQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-00 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Graph (complete) has 510 edges and 256 vertex of which 255 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 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 254 transition count 259
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 214 transition count 259
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 81 place count 214 transition count 219
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 161 place count 174 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 169 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 169 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 165 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 165 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 182 place count 162 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 185 place count 162 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 159 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 159 transition count 200
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 319 place count 95 transition count 136
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 83 transition count 112
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 83 transition count 112
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 71 transition count 100
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 71 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 379 place count 59 transition count 76
Iterating global reduction 2 with 12 rules applied. Total rules applied 391 place count 59 transition count 76
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 403 place count 47 transition count 64
Iterating global reduction 2 with 12 rules applied. Total rules applied 415 place count 47 transition count 64
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 427 place count 35 transition count 40
Iterating global reduction 2 with 12 rules applied. Total rules applied 439 place count 35 transition count 40
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 451 place count 23 transition count 28
Iterating global reduction 2 with 12 rules applied. Total rules applied 463 place count 23 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 2 with 2 rules applied. Total rules applied 465 place count 22 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 467 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 19 vertex of which 18 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
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 471 place count 18 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 473 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 477 place count 14 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 479 place count 12 transition count 19
Applied a total of 479 rules in 69 ms. Remains 12 /256 variables (removed 244) and now considering 19/301 (removed 282) transitions.
[2024-05-22 23:46:07] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-05-22 23:46:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:46:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:46:07] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-22 23:46:07] [INFO ] Invariant cache hit.
[2024-05-22 23:46:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 23:46:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:46:07] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-22 23:46:07] [INFO ] Invariant cache hit.
[2024-05-22 23:46:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/256 places, 19/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 12/256 places, 19/301 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-02 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:(AND (EQ s3 1) (EQ s11 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-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-02 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(p2)&&p1)))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 243 transition count 287
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 243 transition count 287
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 239 transition count 283
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 239 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 236 transition count 279
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 236 transition count 279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 234 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 234 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 232 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 232 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 231 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 231 transition count 273
Applied a total of 50 rules in 34 ms. Remains 231 /256 variables (removed 25) and now considering 273/301 (removed 28) transitions.
// Phase 1: matrix 273 rows 231 cols
[2024-05-22 23:46:07] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 23:46:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 23:46:07] [INFO ] Invariant cache hit.
[2024-05-22 23:46:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-22 23:46:07] [INFO ] Invariant cache hit.
[2024-05-22 23:46:07] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/256 places, 273/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 231/256 places, 273/301 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s175 1) (EQ s227 1)), p0:(AND (EQ s151 1) (EQ s227 1)), p2:(AND (EQ s175 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 503 steps with 0 reset in 11 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-03 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 244 transition count 288
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 244 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 240 transition count 284
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 240 transition count 284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 237 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 237 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 235 transition count 277
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 235 transition count 277
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 233 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 233 transition count 275
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 231 transition count 273
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 231 transition count 273
Applied a total of 50 rules in 37 ms. Remains 231 /256 variables (removed 25) and now considering 273/301 (removed 28) transitions.
// Phase 1: matrix 273 rows 231 cols
[2024-05-22 23:46:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:46:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:46:07] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-22 23:46:08] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/256 places, 273/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 231/256 places, 273/301 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s40 1), p1:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 440 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-04 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Graph (complete) has 510 edges and 256 vertex of which 255 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 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 254 transition count 259
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 214 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 213 transition count 258
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 83 place count 213 transition count 219
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 161 place count 174 transition count 219
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 167 place count 168 transition count 212
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 168 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 173 place count 168 transition count 211
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 175 place count 167 transition count 211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 163 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 163 transition count 207
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 160 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 160 transition count 201
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 157 transition count 198
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 157 transition count 198
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 3 with 126 rules applied. Total rules applied 321 place count 94 transition count 135
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 333 place count 82 transition count 111
Iterating global reduction 3 with 12 rules applied. Total rules applied 345 place count 82 transition count 111
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 357 place count 70 transition count 99
Iterating global reduction 3 with 12 rules applied. Total rules applied 369 place count 70 transition count 99
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 381 place count 58 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 393 place count 58 transition count 75
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 46 transition count 63
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 46 transition count 63
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 428 place count 35 transition count 41
Iterating global reduction 3 with 11 rules applied. Total rules applied 439 place count 35 transition count 41
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 450 place count 24 transition count 30
Iterating global reduction 3 with 11 rules applied. Total rules applied 461 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 465 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 471 place count 17 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 474 place count 14 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 474 place count 14 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 476 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 478 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 480 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 482 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 485 place count 8 transition count 14
Applied a total of 485 rules in 62 ms. Remains 8 /256 variables (removed 248) and now considering 14/301 (removed 287) transitions.
[2024-05-22 23:46:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 23:46:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:46:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 23:46:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:46:08] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-22 23:46:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:46:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:46:08] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/256 places, 14/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 8/256 places, 14/301 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(NEQ s5 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 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (X(p1) U (p2 U G(p3)))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 245 transition count 289
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 245 transition count 289
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 240 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 240 transition count 284
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 236 transition count 279
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 236 transition count 279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 233 transition count 274
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 233 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 230 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 230 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 228 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 228 transition count 269
Applied a total of 56 rules in 24 ms. Remains 228 /256 variables (removed 28) and now considering 269/301 (removed 32) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-22 23:46:08] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:46:08] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 23:46:08] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-22 23:46:08] [INFO ] Invariant cache hit.
[2024-05-22 23:46:08] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/256 places, 269/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 228/256 places, 269/301 transitions.
Stuttering acceptance computed with spot in 923 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=true, acceptance={} source=2 dest: 8}, { cond=p2, acceptance={} source=2 dest: 9}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 11}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(NOT p0), acceptance={} source=8 dest: 14}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 15}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 17}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 18}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=11 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=11 dest: 11}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=11 dest: 12}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=11 dest: 17}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=11 dest: 18}], [{ cond=(AND (NOT p3) p0), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=12 dest: 6}, { cond=(AND p3 p0), acceptance={} source=12 dest: 12}, { cond=(AND p3 (NOT p0)), acceptance={} source=12 dest: 17}], [{ cond=(NOT p1), acceptance={} source=13 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 13}, { cond=p3, acceptance={} source=14 dest: 14}, { cond=(NOT p3), acceptance={0} source=14 dest: 14}, { cond=p2, acceptance={} source=14 dest: 15}, { cond=(AND p3 (NOT p2)), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=15 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=15 dest: 17}, { cond=(AND p2 (NOT p1)), acceptance={} source=15 dest: 18}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=16 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=16 dest: 17}], [{ cond=(NOT p3), acceptance={} source=17 dest: 6}, { cond=p3, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=18 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=18 dest: 17}, { cond=(AND p3 p2), acceptance={} source=18 dest: 18}, { cond=(AND (NOT p3) p2), acceptance={0} source=18 dest: 18}]], initial=0, aps=[p3:(EQ s178 1), p2:(EQ s120 1), p1:(NEQ s105 1), p0:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33296 reset in 256 ms.
Product exploration explored 100000 steps with 33303 reset in 204 ms.
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 461 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 45 stabilizing places and 45 stable transitions
Detected a total of 45/228 stabilizing places and 45/269 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT p2)), (X (NOT p3)), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) p1 p0))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 404 ms. Reduced automaton from 19 states, 56 edges and 4 AP (stutter sensitive) to 19 states, 56 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 936 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 32) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :4
Finished Best-First random walk after 8869 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=985 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT p2)), (X (NOT p3)), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) p1 p0))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) p0))), (F (NOT p1)), (F (AND p1 p2 (NOT p0))), (F (AND p3 (NOT p2))), (F (AND p1 p3 (NOT p2) (NOT p0))), (F (AND (NOT p1) p2)), (F (AND p1 p3 (NOT p2) p0)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F p3), (F (AND p3 (NOT p0))), (F (AND p3 p0)), (F p2), (F (AND (NOT p3) (NOT p0))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND p1 p2 p0)), (F (AND p1 (NOT p3) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p3) (NOT p2) p0))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3 (NOT p2))), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))), (F (AND p3 (NOT p2) (NOT p0))), (F (AND p2 (NOT p0))), (F (AND (NOT p3) (NOT p2) (NOT p0))), (F (AND (NOT p1) p3 (NOT p0))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) p3 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p3) p2)), (F (AND p3 p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))
Knowledge based reduction with 43 factoid took 2032 ms. Reduced automaton from 19 states, 56 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-06 finished in 5588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Graph (complete) has 510 edges and 256 vertex of which 255 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
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 254 transition count 258
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 213 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 212 transition count 257
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 85 place count 212 transition count 218
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 163 place count 173 transition count 218
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 169 place count 167 transition count 211
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 167 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 175 place count 167 transition count 210
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 177 place count 166 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 181 place count 162 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 162 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 159 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 159 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 156 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 156 transition count 197
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 3 with 128 rules applied. Total rules applied 325 place count 92 transition count 133
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 337 place count 80 transition count 109
Iterating global reduction 3 with 12 rules applied. Total rules applied 349 place count 80 transition count 109
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 361 place count 68 transition count 97
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 68 transition count 97
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 385 place count 56 transition count 73
Iterating global reduction 3 with 12 rules applied. Total rules applied 397 place count 56 transition count 73
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 409 place count 44 transition count 61
Iterating global reduction 3 with 12 rules applied. Total rules applied 421 place count 44 transition count 61
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 433 place count 32 transition count 37
Iterating global reduction 3 with 12 rules applied. Total rules applied 445 place count 32 transition count 37
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 457 place count 20 transition count 25
Iterating global reduction 3 with 12 rules applied. Total rules applied 469 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 470 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 472 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 3 with 7 rules applied. Total rules applied 479 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 483 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 487 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 488 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 490 place count 5 transition count 10
Applied a total of 490 rules in 50 ms. Remains 5 /256 variables (removed 251) and now considering 10/301 (removed 291) transitions.
[2024-05-22 23:46:14] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2024-05-22 23:46:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:46:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:46:14] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 23:46:14] [INFO ] Invariant cache hit.
[2024-05-22 23:46:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 23:46:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:46:14] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 23:46:14] [INFO ] Invariant cache hit.
[2024-05-22 23:46:14] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/256 places, 10/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 5/256 places, 10/301 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-08 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 243 transition count 287
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 243 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 238 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 238 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 234 transition count 277
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 234 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 231 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 228 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 226 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 226 transition count 267
Applied a total of 60 rules in 21 ms. Remains 226 /256 variables (removed 30) and now considering 267/301 (removed 34) transitions.
// Phase 1: matrix 267 rows 226 cols
[2024-05-22 23:46:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:46:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 23:46:14] [INFO ] Invariant cache hit.
[2024-05-22 23:46:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-22 23:46:14] [INFO ] Invariant cache hit.
[2024-05-22 23:46:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 267/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 226/256 places, 267/301 transitions.
Stuttering acceptance computed with spot in 75 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:(NEQ s90 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 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 459 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 45 stabilizing places and 45 stable transitions
Detected a total of 45/226 stabilizing places and 45/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-10 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 242 transition count 286
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 242 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 237 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 237 transition count 281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 233 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 233 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 230 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 227 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 225 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 225 transition count 266
Applied a total of 62 rules in 18 ms. Remains 225 /256 variables (removed 31) and now considering 266/301 (removed 35) transitions.
// Phase 1: matrix 266 rows 225 cols
[2024-05-22 23:46:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:46:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 23:46:15] [INFO ] Invariant cache hit.
[2024-05-22 23:46:15] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-22 23:46:15] [INFO ] Invariant cache hit.
[2024-05-22 23:46:15] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/256 places, 266/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 225/256 places, 266/301 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s172 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-11 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Graph (complete) has 510 edges and 256 vertex of which 255 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 254 transition count 257
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 212 transition count 257
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 85 place count 212 transition count 220
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 159 place count 175 transition count 220
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 165 place count 169 transition count 213
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 169 transition count 213
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 169 transition count 212
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 173 place count 168 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 164 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 164 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 184 place count 161 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 187 place count 161 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 158 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 158 transition count 199
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 323 place count 93 transition count 134
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 336 place count 80 transition count 108
Iterating global reduction 2 with 13 rules applied. Total rules applied 349 place count 80 transition count 108
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 362 place count 67 transition count 95
Iterating global reduction 2 with 13 rules applied. Total rules applied 375 place count 67 transition count 95
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 388 place count 54 transition count 69
Iterating global reduction 2 with 13 rules applied. Total rules applied 401 place count 54 transition count 69
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 414 place count 41 transition count 56
Iterating global reduction 2 with 13 rules applied. Total rules applied 427 place count 41 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 439 place count 29 transition count 32
Iterating global reduction 2 with 12 rules applied. Total rules applied 451 place count 29 transition count 32
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 463 place count 17 transition count 20
Iterating global reduction 2 with 12 rules applied. Total rules applied 475 place count 17 transition count 20
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 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 478 place count 15 transition count 17
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 480 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 13 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 481 place count 13 transition count 14
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 485 place count 11 transition count 14
Applied a total of 485 rules in 35 ms. Remains 11 /256 variables (removed 245) and now considering 14/301 (removed 287) transitions.
[2024-05-22 23:46:15] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-22 23:46:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:46:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:46:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:46:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-22 23:46:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:46:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/256 places, 14/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 11/256 places, 14/301 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s10 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 9638 reset in 101 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-12 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||F(p1))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 243 transition count 287
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 243 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 238 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 238 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 234 transition count 277
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 234 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 231 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 228 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 226 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 226 transition count 267
Applied a total of 60 rules in 21 ms. Remains 226 /256 variables (removed 30) and now considering 267/301 (removed 34) transitions.
// Phase 1: matrix 267 rows 226 cols
[2024-05-22 23:46:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:46:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 267/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 226/256 places, 267/301 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (EQ s156 1) (EQ s225 1)), p0:(EQ s204 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 516 reset in 227 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-13 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||G(F(p1))))) U G(p2)))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 301/301 transitions.
Graph (complete) has 510 edges and 256 vertex of which 255 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 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 254 transition count 258
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 213 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 212 transition count 257
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 85 place count 212 transition count 221
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 157 place count 176 transition count 221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 163 place count 170 transition count 214
Iterating global reduction 3 with 6 rules applied. Total rules applied 169 place count 170 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 169 place count 170 transition count 213
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 171 place count 169 transition count 213
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 165 transition count 209
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 165 transition count 209
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 162 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 162 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 159 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 159 transition count 200
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 3 with 126 rules applied. Total rules applied 317 place count 96 transition count 137
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 330 place count 83 transition count 111
Iterating global reduction 3 with 13 rules applied. Total rules applied 343 place count 83 transition count 111
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 356 place count 70 transition count 98
Iterating global reduction 3 with 13 rules applied. Total rules applied 369 place count 70 transition count 98
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 381 place count 58 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 393 place count 58 transition count 74
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 46 transition count 62
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 46 transition count 62
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 429 place count 34 transition count 38
Iterating global reduction 3 with 12 rules applied. Total rules applied 441 place count 34 transition count 38
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 452 place count 23 transition count 27
Iterating global reduction 3 with 11 rules applied. Total rules applied 463 place count 23 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 464 place count 23 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 466 place count 21 transition count 24
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 468 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 469 place count 19 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 469 place count 19 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 475 place count 16 transition count 20
Applied a total of 475 rules in 34 ms. Remains 16 /256 variables (removed 240) and now considering 20/301 (removed 281) transitions.
[2024-05-22 23:46:17] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-22 23:46:17] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:46:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 23:46:17] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-22 23:46:17] [INFO ] Invariant cache hit.
[2024-05-22 23:46:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:46:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-22 23:46:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:46:17] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-22 23:46:17] [INFO ] Invariant cache hit.
[2024-05-22 23:46:17] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/256 places, 20/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 16/256 places, 20/301 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s15 1)), p0:(EQ s9 1), p1:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 32997 reset in 87 ms.
Stack based approach found an accepted trace after 456 steps with 152 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-14 finished in 494 ms.
All properties solved by simple procedures.
Total runtime 13099 ms.

BK_STOP 1716421578641

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r153-tall-171631151600313"
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 ;