Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410800372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DiscoveryGPU-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410800372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 82K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678439586402

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 09:13:09] [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]
[2023-03-10 09:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:13:10] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-10 09:13:10] [INFO ] Transformed 324 places.
[2023-03-10 09:13:10] [INFO ] Transformed 344 transitions.
[2023-03-10 09:13:10] [INFO ] Found NUPN structural information;
[2023-03-10 09:13:10] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 75 place count 249 transition count 291
Iterating global reduction 1 with 53 rules applied. Total rules applied 128 place count 249 transition count 291
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 137 place count 240 transition count 282
Iterating global reduction 1 with 9 rules applied. Total rules applied 146 place count 240 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 153 place count 233 transition count 275
Iterating global reduction 1 with 7 rules applied. Total rules applied 160 place count 233 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 166 place count 227 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 172 place count 227 transition count 269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 177 place count 222 transition count 259
Iterating global reduction 1 with 5 rules applied. Total rules applied 182 place count 222 transition count 259
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 187 place count 217 transition count 254
Iterating global reduction 1 with 5 rules applied. Total rules applied 192 place count 217 transition count 254
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 197 place count 212 transition count 249
Iterating global reduction 1 with 5 rules applied. Total rules applied 202 place count 212 transition count 249
Applied a total of 202 rules in 174 ms. Remains 212 /324 variables (removed 112) and now considering 249/344 (removed 95) transitions.
// Phase 1: matrix 249 rows 212 cols
[2023-03-10 09:13:10] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-10 09:13:10] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-10 09:13:10] [INFO ] Invariant cache hit.
[2023-03-10 09:13:11] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-10 09:13:11] [INFO ] Invariant cache hit.
[2023-03-10 09:13:11] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/324 places, 249/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 212/324 places, 249/344 transitions.
Support contains 27 out of 212 places after structural reductions.
[2023-03-10 09:13:12] [INFO ] Flatten gal took : 74 ms
[2023-03-10 09:13:12] [INFO ] Flatten gal took : 32 ms
[2023-03-10 09:13:12] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 26 out of 212 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-10 09:13:13] [INFO ] Invariant cache hit.
[2023-03-10 09:13:13] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 09:13:13] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 09:13:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:13:13] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 422 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1)&&G(p2))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 206 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 206 transition count 243
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 202 transition count 237
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 202 transition count 237
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 198 transition count 233
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 198 transition count 233
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 194 transition count 228
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 194 transition count 228
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 192 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 192 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 190 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 190 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 189 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 189 transition count 222
Applied a total of 46 rules in 35 ms. Remains 189 /212 variables (removed 23) and now considering 222/249 (removed 27) transitions.
// Phase 1: matrix 222 rows 189 cols
[2023-03-10 09:13:13] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 09:13:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 09:13:13] [INFO ] Invariant cache hit.
[2023-03-10 09:13:14] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-10 09:13:14] [INFO ] Invariant cache hit.
[2023-03-10 09:13:14] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 222/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 189/212 places, 222/249 transitions.
Stuttering acceptance computed with spot in 436 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}]], initial=1, aps=[p2:(AND (OR (NEQ s177 1) (NEQ s183 1)) (NEQ s184 1)), p0:(EQ s36 0), p1:(EQ s184 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-00 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1||(X(F(p1))&&G(p2))))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Graph (complete) has 422 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 209 transition count 217
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 180 transition count 217
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 59 place count 180 transition count 180
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 133 place count 143 transition count 180
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 139 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 139 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 137 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 137 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 135 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 135 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 134 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 134 transition count 169
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 251 place count 84 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 260 place count 75 transition count 102
Iterating global reduction 2 with 9 rules applied. Total rules applied 269 place count 75 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 277 place count 67 transition count 92
Iterating global reduction 2 with 8 rules applied. Total rules applied 285 place count 67 transition count 92
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 293 place count 59 transition count 77
Iterating global reduction 2 with 8 rules applied. Total rules applied 301 place count 59 transition count 77
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 309 place count 51 transition count 68
Iterating global reduction 2 with 8 rules applied. Total rules applied 317 place count 51 transition count 68
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 325 place count 43 transition count 53
Iterating global reduction 2 with 8 rules applied. Total rules applied 333 place count 43 transition count 53
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 341 place count 35 transition count 44
Iterating global reduction 2 with 8 rules applied. Total rules applied 349 place count 35 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 33 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 33 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 32 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 32 transition count 40
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 32 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 358 place count 32 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 30 transition count 36
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 363 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 366 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 367 place count 26 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 367 place count 26 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 375 place count 22 transition count 29
Applied a total of 375 rules in 123 ms. Remains 22 /212 variables (removed 190) and now considering 29/249 (removed 220) transitions.
[2023-03-10 09:13:14] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 22 cols
[2023-03-10 09:13:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 09:13:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-10 09:13:15] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-10 09:13:15] [INFO ] Invariant cache hit.
[2023-03-10 09:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:13:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-10 09:13:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:13:15] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-10 09:13:15] [INFO ] Invariant cache hit.
[2023-03-10 09:13:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/212 places, 29/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 22/212 places, 29/249 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s10 0), p2:(OR (EQ s16 0) (EQ s21 0)), p0:(EQ s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-01 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 241
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 198 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 198 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 193 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 193 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 188 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 188 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 185 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 185 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 182 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 180 transition count 212
Applied a total of 64 rules in 33 ms. Remains 180 /212 variables (removed 32) and now considering 212/249 (removed 37) transitions.
// Phase 1: matrix 212 rows 180 cols
[2023-03-10 09:13:15] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-10 09:13:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-10 09:13:15] [INFO ] Invariant cache hit.
[2023-03-10 09:13:15] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-10 09:13:15] [INFO ] Invariant cache hit.
[2023-03-10 09:13:15] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/212 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 180/212 places, 212/249 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 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]]
Stuttering criterion allowed to conclude after 332 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-03 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 241
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 198 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 198 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 193 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 193 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 188 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 188 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 185 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 185 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 182 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 180 transition count 212
Applied a total of 64 rules in 59 ms. Remains 180 /212 variables (removed 32) and now considering 212/249 (removed 37) transitions.
[2023-03-10 09:13:16] [INFO ] Invariant cache hit.
[2023-03-10 09:13:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-10 09:13:16] [INFO ] Invariant cache hit.
[2023-03-10 09:13:16] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-10 09:13:16] [INFO ] Invariant cache hit.
[2023-03-10 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/212 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 180/212 places, 212/249 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s162 1) (EQ s176 1)) (AND (EQ s22 1) (EQ s176 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]]
Stuttering criterion allowed to conclude after 1693 steps with 6 reset in 13 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-05 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Graph (complete) has 422 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 208 transition count 215
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 178 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 177 transition count 214
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 63 place count 177 transition count 178
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 135 place count 141 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 136 transition count 173
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 136 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 145 place count 136 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 135 transition count 172
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 132 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 132 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 129 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 129 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 127 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 127 transition count 161
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 259 place count 79 transition count 113
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 268 place count 70 transition count 96
Iterating global reduction 3 with 9 rules applied. Total rules applied 277 place count 70 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 286 place count 61 transition count 86
Iterating global reduction 3 with 9 rules applied. Total rules applied 295 place count 61 transition count 86
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 304 place count 52 transition count 68
Iterating global reduction 3 with 9 rules applied. Total rules applied 313 place count 52 transition count 68
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 322 place count 43 transition count 59
Iterating global reduction 3 with 9 rules applied. Total rules applied 331 place count 43 transition count 59
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 339 place count 35 transition count 43
Iterating global reduction 3 with 8 rules applied. Total rules applied 347 place count 35 transition count 43
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 355 place count 27 transition count 35
Iterating global reduction 3 with 8 rules applied. Total rules applied 363 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 26 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 366 place count 25 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 367 place count 25 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 368 place count 25 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 26 edges and 21 vertex of which 18 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 377 place count 18 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 380 place count 15 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 380 place count 15 transition count 22
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 382 place count 14 transition count 22
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 386 place count 12 transition count 20
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 388 place count 11 transition count 20
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 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 394 place count 8 transition count 14
Applied a total of 394 rules in 85 ms. Remains 8 /212 variables (removed 204) and now considering 14/249 (removed 235) transitions.
[2023-03-10 09:13:16] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2023-03-10 09:13:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 09:13:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 09:13:16] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-10 09:13:16] [INFO ] Invariant cache hit.
[2023-03-10 09:13:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 09:13:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 09:13:16] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-10 09:13:16] [INFO ] Invariant cache hit.
[2023-03-10 09:13:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/212 places, 14/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 8/212 places, 14/249 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s6 1)], nbAcceptance=2, 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-11b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-06 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Graph (complete) has 422 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 208 transition count 214
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 177 transition count 214
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 63 place count 177 transition count 178
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 135 place count 141 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 136 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 136 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 136 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 135 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 132 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 132 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 129 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 129 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 127 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 127 transition count 161
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 259 place count 79 transition count 113
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 269 place count 69 transition count 94
Iterating global reduction 2 with 10 rules applied. Total rules applied 279 place count 69 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 289 place count 59 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 299 place count 59 transition count 82
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 308 place count 50 transition count 65
Iterating global reduction 2 with 9 rules applied. Total rules applied 317 place count 50 transition count 65
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 41 transition count 55
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 41 transition count 55
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 344 place count 32 transition count 38
Iterating global reduction 2 with 9 rules applied. Total rules applied 353 place count 32 transition count 38
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 361 place count 24 transition count 29
Iterating global reduction 2 with 8 rules applied. Total rules applied 369 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 371 place count 22 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 374 place count 21 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 21 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 21 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 19 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 384 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 386 place count 12 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 392 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 9 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 395 place count 7 transition count 11
Applied a total of 395 rules in 91 ms. Remains 7 /212 variables (removed 205) and now considering 11/249 (removed 238) transitions.
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 7 cols
[2023-03-10 09:13:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 09:13:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/212 places, 11/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 7/212 places, 11/249 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0), p1:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-09 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Graph (complete) has 422 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 209 transition count 214
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 177 transition count 214
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 65 place count 177 transition count 178
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 137 place count 141 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 137 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 137 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 137 transition count 173
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 147 place count 136 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 134 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 134 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 153 place count 132 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 155 place count 132 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 131 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 131 transition count 166
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 259 place count 80 transition count 115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 268 place count 71 transition count 98
Iterating global reduction 2 with 9 rules applied. Total rules applied 277 place count 71 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 286 place count 62 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 295 place count 62 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 304 place count 53 transition count 70
Iterating global reduction 2 with 9 rules applied. Total rules applied 313 place count 53 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 322 place count 44 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 331 place count 44 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 340 place count 35 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 349 place count 35 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 358 place count 26 transition count 33
Iterating global reduction 2 with 9 rules applied. Total rules applied 367 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 369 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 372 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 23 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 377 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 386 place count 16 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 392 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 396 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 399 place count 6 transition count 11
Applied a total of 399 rules in 64 ms. Remains 6 /212 variables (removed 206) and now considering 11/249 (removed 238) transitions.
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-10 09:13:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 09:13:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/212 places, 11/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 6/212 places, 11/249 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 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-11b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-10 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((G(p1)&&F(p2)))&&p0))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Graph (complete) has 422 edges and 212 vertex of which 209 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 208 transition count 214
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 177 transition count 214
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 63 place count 177 transition count 179
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 133 place count 142 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 138 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 138 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 141 place count 138 transition count 174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 137 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 135 transition count 172
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 135 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 133 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 133 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 153 place count 131 transition count 166
Iterating global reduction 2 with 2 rules applied. Total rules applied 155 place count 131 transition count 166
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 255 place count 81 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 264 place count 72 transition count 99
Iterating global reduction 2 with 9 rules applied. Total rules applied 273 place count 72 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 282 place count 63 transition count 88
Iterating global reduction 2 with 9 rules applied. Total rules applied 291 place count 63 transition count 88
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 300 place count 54 transition count 71
Iterating global reduction 2 with 9 rules applied. Total rules applied 309 place count 54 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 46 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 46 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 38 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 38 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 30 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 362 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 363 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 364 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 42 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 370 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 21 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 374 place count 20 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 376 place count 19 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 379 place count 16 transition count 25
Applied a total of 379 rules in 40 ms. Remains 16 /212 variables (removed 196) and now considering 25/249 (removed 224) transitions.
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 16 cols
[2023-03-10 09:13:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-10 09:13:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 09:13:17] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-10 09:13:17] [INFO ] Invariant cache hit.
[2023-03-10 09:13:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/212 places, 25/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 16/212 places, 25/249 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s15 1)), p1:(AND (EQ s7 1) (EQ s15 1)), p2:(AND (EQ s11 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-11 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1)))&&X(X(p1))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 241
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 198 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 198 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 193 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 193 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 188 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 188 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 185 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 185 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 184 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 184 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 183 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 183 transition count 215
Applied a total of 58 rules in 21 ms. Remains 183 /212 variables (removed 29) and now considering 215/249 (removed 34) transitions.
// Phase 1: matrix 215 rows 183 cols
[2023-03-10 09:13:18] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 09:13:18] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 09:13:18] [INFO ] Invariant cache hit.
[2023-03-10 09:13:18] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-10 09:13:18] [INFO ] Invariant cache hit.
[2023-03-10 09:13:18] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/212 places, 215/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 183/212 places, 215/249 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s148 1) (EQ s182 1)), p1:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-12 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(p0)) U p1))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 206 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 206 transition count 243
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 201 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 201 transition count 236
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 197 transition count 232
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 197 transition count 232
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 193 transition count 228
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 193 transition count 228
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 191 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 191 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 189 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 189 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 187 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 187 transition count 220
Applied a total of 50 rules in 28 ms. Remains 187 /212 variables (removed 25) and now considering 220/249 (removed 29) transitions.
// Phase 1: matrix 220 rows 187 cols
[2023-03-10 09:13:18] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 09:13:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 09:13:18] [INFO ] Invariant cache hit.
[2023-03-10 09:13:19] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-10 09:13:19] [INFO ] Invariant cache hit.
[2023-03-10 09:13:19] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/212 places, 220/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 187/212 places, 220/249 transitions.
Stuttering acceptance computed with spot in 162 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s16 1) (EQ s183 1)), p1:(AND (EQ s8 1) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 335 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-13 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 249/249 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 241
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 198 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 198 transition count 233
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 193 transition count 228
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 193 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 188 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 188 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 185 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 185 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 182 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 180 transition count 212
Applied a total of 64 rules in 22 ms. Remains 180 /212 variables (removed 32) and now considering 212/249 (removed 37) transitions.
// Phase 1: matrix 212 rows 180 cols
[2023-03-10 09:13:19] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 09:13:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 09:13:19] [INFO ] Invariant cache hit.
[2023-03-10 09:13:19] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-10 09:13:19] [INFO ] Invariant cache hit.
[2023-03-10 09:13:20] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/212 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 180/212 places, 212/249 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s53 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Product exploration explored 100000 steps with 50000 reset in 539 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 365 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 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-11b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-14 finished in 2106 ms.
All properties solved by simple procedures.
Total runtime 12030 ms.

BK_STOP 1678439602586

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-11b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-11b, 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 r133-smll-167819410800372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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