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.r241-tall-171649628400228.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 LeafsetExtension-PT-S32C2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716563456326

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=LeafsetExtension-PT-S32C2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 15:10:57] [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-24 15:10:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:10:57] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-24 15:10:58] [INFO ] Transformed 5622 places.
[2024-05-24 15:10:58] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:10:58] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 304 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 3 formulas.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1047 places :
Symmetric choice reduction at 1 with 1047 rule applications. Total rules 2140 place count 3482 transition count 4402
Iterating global reduction 1 with 1047 rules applied. Total rules applied 3187 place count 3482 transition count 4402
Discarding 981 places :
Symmetric choice reduction at 1 with 981 rule applications. Total rules 4168 place count 2501 transition count 3421
Iterating global reduction 1 with 981 rules applied. Total rules applied 5149 place count 2501 transition count 3421
Discarding 969 places :
Symmetric choice reduction at 1 with 969 rule applications. Total rules 6118 place count 1532 transition count 2452
Iterating global reduction 1 with 969 rules applied. Total rules applied 7087 place count 1532 transition count 2452
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 1 with 45 rules applied. Total rules applied 7132 place count 1487 transition count 2452
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 7175 place count 1444 transition count 2409
Iterating global reduction 2 with 43 rules applied. Total rules applied 7218 place count 1444 transition count 2409
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 7260 place count 1402 transition count 2367
Iterating global reduction 2 with 42 rules applied. Total rules applied 7302 place count 1402 transition count 2367
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 7342 place count 1362 transition count 2327
Iterating global reduction 2 with 40 rules applied. Total rules applied 7382 place count 1362 transition count 2327
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 7422 place count 1322 transition count 2287
Iterating global reduction 2 with 40 rules applied. Total rules applied 7462 place count 1322 transition count 2287
Discarding 608 places :
Symmetric choice reduction at 2 with 608 rule applications. Total rules 8070 place count 714 transition count 1679
Iterating global reduction 2 with 608 rules applied. Total rules applied 8678 place count 714 transition count 1679
Applied a total of 8678 rules in 1875 ms. Remains 714 /5622 variables (removed 4908) and now considering 1679/5449 (removed 3770) transitions.
[2024-05-24 15:11:00] [INFO ] Flow matrix only has 1072 transitions (discarded 607 similar events)
// Phase 1: matrix 1072 rows 714 cols
[2024-05-24 15:11:00] [INFO ] Computed 57 invariants in 73 ms
[2024-05-24 15:11:01] [INFO ] Implicit Places using invariants in 914 ms returned [47, 92, 120, 124, 128, 132, 136, 174, 202, 206, 210, 240, 260, 264, 284, 291, 295, 321, 323, 327, 331, 350, 372, 377, 381, 385, 389, 409, 413, 435, 461, 466, 510, 531, 535, 555, 562, 566, 586, 590, 612, 616, 637, 662, 684]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 942 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 669/5622 places, 1679/5449 transitions.
Discarding 401 places :
Symmetric choice reduction at 0 with 401 rule applications. Total rules 401 place count 268 transition count 1278
Iterating global reduction 0 with 401 rules applied. Total rules applied 802 place count 268 transition count 1278
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 814 place count 256 transition count 1266
Iterating global reduction 0 with 12 rules applied. Total rules applied 826 place count 256 transition count 1266
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 838 place count 244 transition count 1254
Iterating global reduction 0 with 12 rules applied. Total rules applied 850 place count 244 transition count 1254
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 862 place count 232 transition count 1242
Iterating global reduction 0 with 12 rules applied. Total rules applied 874 place count 232 transition count 1242
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 892 place count 214 transition count 1224
Iterating global reduction 0 with 18 rules applied. Total rules applied 910 place count 214 transition count 1224
Applied a total of 910 rules in 67 ms. Remains 214 /669 variables (removed 455) and now considering 1224/1679 (removed 455) transitions.
[2024-05-24 15:11:01] [INFO ] Flow matrix only has 410 transitions (discarded 814 similar events)
// Phase 1: matrix 410 rows 214 cols
[2024-05-24 15:11:01] [INFO ] Computed 12 invariants in 4 ms
[2024-05-24 15:11:01] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-24 15:11:01] [INFO ] Flow matrix only has 410 transitions (discarded 814 similar events)
[2024-05-24 15:11:01] [INFO ] Invariant cache hit.
[2024-05-24 15:11:01] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 214/5622 places, 1224/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3318 ms. Remains : 214/5622 places, 1224/5449 transitions.
Support contains 40 out of 214 places after structural reductions.
[2024-05-24 15:11:01] [INFO ] Flatten gal took : 100 ms
[2024-05-24 15:11:01] [INFO ] Flatten gal took : 59 ms
[2024-05-24 15:11:01] [INFO ] Input system was already deterministic with 1224 transitions.
Support contains 38 out of 214 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 531 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Finished Best-First random walk after 7796 steps, including 50 resets, run visited all 1 properties in 10 ms. (steps per millisecond=779 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 214 stabilizing places and 1224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 214 transition count 1224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((p0||X(F(p1))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 103 place count 156 transition count 1167
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 156 transition count 1167
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 122 place count 149 transition count 1167
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 138 place count 133 transition count 1151
Iterating global reduction 2 with 16 rules applied. Total rules applied 154 place count 133 transition count 1151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 125 transition count 1143
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 125 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 117 transition count 1135
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 117 transition count 1135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 194 place count 109 transition count 1127
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 109 transition count 1127
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 99 transition count 1117
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 99 transition count 1117
Applied a total of 222 rules in 56 ms. Remains 99 /214 variables (removed 115) and now considering 1117/1224 (removed 107) transitions.
[2024-05-24 15:11:02] [INFO ] Flow matrix only has 115 transitions (discarded 1002 similar events)
// Phase 1: matrix 115 rows 99 cols
[2024-05-24 15:11:02] [INFO ] Computed 4 invariants in 6 ms
[2024-05-24 15:11:03] [INFO ] Implicit Places using invariants in 115 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/214 places, 1117/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 1115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 1115
Applied a total of 4 rules in 9 ms. Remains 96 /98 variables (removed 2) and now considering 1115/1117 (removed 2) transitions.
[2024-05-24 15:11:03] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2024-05-24 15:11:03] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:11:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 15:11:03] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
[2024-05-24 15:11:03] [INFO ] Invariant cache hit.
[2024-05-24 15:11:03] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/214 places, 1115/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 423 ms. Remains : 96/214 places, 1115/1224 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 279 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LT s32 1), p1:(LT s56 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]]
Product exploration explored 100000 steps with 33333 reset in 465 ms.
Product exploration explored 100000 steps with 33333 reset in 356 ms.
Computed a total of 96 stabilizing places and 1115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 96 transition count 1115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-00 finished in 1998 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 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 190 transition count 1200
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 190 transition count 1200
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 71 place count 167 transition count 1177
Iterating global reduction 0 with 23 rules applied. Total rules applied 94 place count 167 transition count 1177
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 166 transition count 1177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 107 place count 154 transition count 1165
Iterating global reduction 1 with 12 rules applied. Total rules applied 119 place count 154 transition count 1165
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 127 place count 146 transition count 1165
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 145 place count 128 transition count 1147
Iterating global reduction 2 with 18 rules applied. Total rules applied 163 place count 128 transition count 1147
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 172 place count 119 transition count 1138
Iterating global reduction 2 with 9 rules applied. Total rules applied 181 place count 119 transition count 1138
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 190 place count 110 transition count 1129
Iterating global reduction 2 with 9 rules applied. Total rules applied 199 place count 110 transition count 1129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 101 transition count 1120
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 101 transition count 1120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 228 place count 90 transition count 1109
Iterating global reduction 2 with 11 rules applied. Total rules applied 239 place count 90 transition count 1109
Applied a total of 239 rules in 51 ms. Remains 90 /214 variables (removed 124) and now considering 1109/1224 (removed 115) transitions.
[2024-05-24 15:11:04] [INFO ] Flow matrix only has 106 transitions (discarded 1003 similar events)
// Phase 1: matrix 106 rows 90 cols
[2024-05-24 15:11:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:11:04] [INFO ] Implicit Places using invariants in 95 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/214 places, 1109/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 1107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 1107
Applied a total of 4 rules in 11 ms. Remains 87 /89 variables (removed 2) and now considering 1107/1109 (removed 2) transitions.
[2024-05-24 15:11:04] [INFO ] Flow matrix only has 103 transitions (discarded 1004 similar events)
// Phase 1: matrix 103 rows 87 cols
[2024-05-24 15:11:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:11:05] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 15:11:05] [INFO ] Flow matrix only has 103 transitions (discarded 1004 similar events)
[2024-05-24 15:11:05] [INFO ] Invariant cache hit.
[2024-05-24 15:11:05] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/214 places, 1107/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 87/214 places, 1107/1224 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-01 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:(OR (LT s26 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 87 stabilizing places and 1107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 87 transition count 1107
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-01 finished in 1238 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((G(F(p0))||(p1&&G(p2)))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 168 transition count 1178
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 168 transition count 1178
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 167 transition count 1178
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 106 place count 154 transition count 1165
Iterating global reduction 1 with 13 rules applied. Total rules applied 119 place count 154 transition count 1165
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 127 place count 146 transition count 1165
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 145 place count 128 transition count 1147
Iterating global reduction 2 with 18 rules applied. Total rules applied 163 place count 128 transition count 1147
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 172 place count 119 transition count 1138
Iterating global reduction 2 with 9 rules applied. Total rules applied 181 place count 119 transition count 1138
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 190 place count 110 transition count 1129
Iterating global reduction 2 with 9 rules applied. Total rules applied 199 place count 110 transition count 1129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 101 transition count 1120
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 101 transition count 1120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 228 place count 90 transition count 1109
Iterating global reduction 2 with 11 rules applied. Total rules applied 239 place count 90 transition count 1109
Applied a total of 239 rules in 31 ms. Remains 90 /214 variables (removed 124) and now considering 1109/1224 (removed 115) transitions.
[2024-05-24 15:11:06] [INFO ] Flow matrix only has 92 transitions (discarded 1017 similar events)
// Phase 1: matrix 92 rows 90 cols
[2024-05-24 15:11:06] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 15:11:06] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 15:11:06] [INFO ] Flow matrix only has 92 transitions (discarded 1017 similar events)
[2024-05-24 15:11:06] [INFO ] Invariant cache hit.
[2024-05-24 15:11:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-24 15:11:06] [INFO ] Flow matrix only has 92 transitions (discarded 1017 similar events)
[2024-05-24 15:11:06] [INFO ] Invariant cache hit.
[2024-05-24 15:11:06] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/214 places, 1109/1224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 90/214 places, 1109/1224 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s41 1) (LT s44 1)), p1:(OR (LT s34 1) (LT s49 1)), p2:(OR (LT s34 1) (LT s49 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5517 reset in 256 ms.
Product exploration explored 100000 steps with 5515 reset in 236 ms.
Computed a total of 90 stabilizing places and 1109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 1109
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (OR (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-02 finished in 1421 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(((p0 U p1)&&F(G(!p0))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 102 place count 157 transition count 1168
Iterating global reduction 1 with 11 rules applied. Total rules applied 113 place count 157 transition count 1168
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 150 transition count 1168
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 135 transition count 1153
Iterating global reduction 2 with 15 rules applied. Total rules applied 150 place count 135 transition count 1153
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 127 transition count 1145
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 127 transition count 1145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 174 place count 119 transition count 1137
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 119 transition count 1137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 190 place count 111 transition count 1129
Iterating global reduction 2 with 8 rules applied. Total rules applied 198 place count 111 transition count 1129
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 208 place count 101 transition count 1119
Iterating global reduction 2 with 10 rules applied. Total rules applied 218 place count 101 transition count 1119
Applied a total of 218 rules in 33 ms. Remains 101 /214 variables (removed 113) and now considering 1119/1224 (removed 105) transitions.
[2024-05-24 15:11:07] [INFO ] Flow matrix only has 132 transitions (discarded 987 similar events)
// Phase 1: matrix 132 rows 101 cols
[2024-05-24 15:11:07] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:11:07] [INFO ] Implicit Places using invariants in 101 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/214 places, 1119/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 1117
Applied a total of 4 rules in 7 ms. Remains 98 /100 variables (removed 2) and now considering 1117/1119 (removed 2) transitions.
[2024-05-24 15:11:07] [INFO ] Flow matrix only has 129 transitions (discarded 988 similar events)
// Phase 1: matrix 129 rows 98 cols
[2024-05-24 15:11:07] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:11:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 15:11:07] [INFO ] Flow matrix only has 129 transitions (discarded 988 similar events)
[2024-05-24 15:11:07] [INFO ] Invariant cache hit.
[2024-05-24 15:11:07] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/214 places, 1117/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 98/214 places, 1117/1224 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1), p0]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s95 1), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-03 finished in 632 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||F((X(p2)&&p1))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 190 transition count 1200
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 190 transition count 1200
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 71 place count 167 transition count 1177
Iterating global reduction 0 with 23 rules applied. Total rules applied 94 place count 167 transition count 1177
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 166 transition count 1177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 107 place count 154 transition count 1165
Iterating global reduction 1 with 12 rules applied. Total rules applied 119 place count 154 transition count 1165
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 147 transition count 1165
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 142 place count 131 transition count 1149
Iterating global reduction 2 with 16 rules applied. Total rules applied 158 place count 131 transition count 1149
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 166 place count 123 transition count 1141
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 123 transition count 1141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 115 transition count 1133
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 115 transition count 1133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 198 place count 107 transition count 1125
Iterating global reduction 2 with 8 rules applied. Total rules applied 206 place count 107 transition count 1125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 216 place count 97 transition count 1115
Iterating global reduction 2 with 10 rules applied. Total rules applied 226 place count 97 transition count 1115
Applied a total of 226 rules in 36 ms. Remains 97 /214 variables (removed 117) and now considering 1115/1224 (removed 109) transitions.
[2024-05-24 15:11:08] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 97 cols
[2024-05-24 15:11:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 15:11:08] [INFO ] Implicit Places using invariants in 100 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/214 places, 1115/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 1113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 1113
Applied a total of 4 rules in 7 ms. Remains 94 /96 variables (removed 2) and now considering 1113/1115 (removed 2) transitions.
[2024-05-24 15:11:08] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
// Phase 1: matrix 109 rows 94 cols
[2024-05-24 15:11:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:11:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 15:11:08] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
[2024-05-24 15:11:08] [INFO ] Invariant cache hit.
[2024-05-24 15:11:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/214 places, 1113/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 94/214 places, 1113/1224 transitions.
Stuttering acceptance computed with spot in 149 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 : LeafsetExtension-PT-S32C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s38 1), p1:(AND (GEQ s30 1) (GEQ s58 1)), p2:(AND (GEQ s30 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5515 reset in 180 ms.
Product exploration explored 100000 steps with 5506 reset in 252 ms.
Computed a total of 94 stabilizing places and 1113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 1113
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 15 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-05 finished in 1114 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&&X(p1))||G(p1))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 103 place count 156 transition count 1167
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 156 transition count 1167
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 122 place count 149 transition count 1167
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 138 place count 133 transition count 1151
Iterating global reduction 2 with 16 rules applied. Total rules applied 154 place count 133 transition count 1151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 125 transition count 1143
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 125 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 117 transition count 1135
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 117 transition count 1135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 194 place count 109 transition count 1127
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 109 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 100 transition count 1118
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 100 transition count 1118
Applied a total of 220 rules in 26 ms. Remains 100 /214 variables (removed 114) and now considering 1118/1224 (removed 106) transitions.
[2024-05-24 15:11:09] [INFO ] Flow matrix only has 116 transitions (discarded 1002 similar events)
// Phase 1: matrix 116 rows 100 cols
[2024-05-24 15:11:09] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:11:09] [INFO ] Implicit Places using invariants in 106 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/214 places, 1118/1224 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 1115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 1115
Applied a total of 6 rules in 7 ms. Remains 96 /99 variables (removed 3) and now considering 1115/1118 (removed 3) transitions.
[2024-05-24 15:11:09] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2024-05-24 15:11:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:11:09] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 15:11:09] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
[2024-05-24 15:11:09] [INFO ] Invariant cache hit.
[2024-05-24 15:11:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/214 places, 1115/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 96/214 places, 1115/1224 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s84 1), p1:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 96 stabilizing places and 1115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 96 transition count 1115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 951 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-06 finished in 2082 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&&(X(G(p1)) U (p2&&X(G(p1)))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 192 transition count 1202
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 192 transition count 1202
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 65 place count 171 transition count 1181
Iterating global reduction 0 with 21 rules applied. Total rules applied 86 place count 171 transition count 1181
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 170 transition count 1181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 100 place count 157 transition count 1168
Iterating global reduction 1 with 13 rules applied. Total rules applied 113 place count 157 transition count 1168
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 149 transition count 1168
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 139 place count 131 transition count 1150
Iterating global reduction 2 with 18 rules applied. Total rules applied 157 place count 131 transition count 1150
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 166 place count 122 transition count 1141
Iterating global reduction 2 with 9 rules applied. Total rules applied 175 place count 122 transition count 1141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 184 place count 113 transition count 1132
Iterating global reduction 2 with 9 rules applied. Total rules applied 193 place count 113 transition count 1132
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 202 place count 104 transition count 1123
Iterating global reduction 2 with 9 rules applied. Total rules applied 211 place count 104 transition count 1123
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 222 place count 93 transition count 1112
Iterating global reduction 2 with 11 rules applied. Total rules applied 233 place count 93 transition count 1112
Applied a total of 233 rules in 31 ms. Remains 93 /214 variables (removed 121) and now considering 1112/1224 (removed 112) transitions.
[2024-05-24 15:11:11] [INFO ] Flow matrix only has 96 transitions (discarded 1016 similar events)
// Phase 1: matrix 96 rows 93 cols
[2024-05-24 15:11:11] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:11:11] [INFO ] Implicit Places using invariants in 94 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/214 places, 1112/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 1110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 1110
Applied a total of 4 rules in 7 ms. Remains 90 /92 variables (removed 2) and now considering 1110/1112 (removed 2) transitions.
[2024-05-24 15:11:11] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
// Phase 1: matrix 93 rows 90 cols
[2024-05-24 15:11:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 15:11:11] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 15:11:11] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
[2024-05-24 15:11:11] [INFO ] Invariant cache hit.
[2024-05-24 15:11:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/214 places, 1110/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 90/214 places, 1110/1224 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(LT s77 1), p0:(LT s35 1), p2:(GEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-08 finished in 598 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 X(((p0 U p1)||p1))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 102 place count 157 transition count 1168
Iterating global reduction 1 with 11 rules applied. Total rules applied 113 place count 157 transition count 1168
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 150 transition count 1168
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 134 transition count 1152
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 134 transition count 1152
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 160 place count 126 transition count 1144
Iterating global reduction 2 with 8 rules applied. Total rules applied 168 place count 126 transition count 1144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 118 transition count 1136
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 118 transition count 1136
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 192 place count 110 transition count 1128
Iterating global reduction 2 with 8 rules applied. Total rules applied 200 place count 110 transition count 1128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 210 place count 100 transition count 1118
Iterating global reduction 2 with 10 rules applied. Total rules applied 220 place count 100 transition count 1118
Applied a total of 220 rules in 31 ms. Remains 100 /214 variables (removed 114) and now considering 1118/1224 (removed 106) transitions.
[2024-05-24 15:11:11] [INFO ] Flow matrix only has 131 transitions (discarded 987 similar events)
// Phase 1: matrix 131 rows 100 cols
[2024-05-24 15:11:11] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:11:12] [INFO ] Implicit Places using invariants in 101 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/214 places, 1118/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 97 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 1116
Applied a total of 4 rules in 6 ms. Remains 97 /99 variables (removed 2) and now considering 1116/1118 (removed 2) transitions.
[2024-05-24 15:11:12] [INFO ] Flow matrix only has 128 transitions (discarded 988 similar events)
// Phase 1: matrix 128 rows 97 cols
[2024-05-24 15:11:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:11:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 15:11:12] [INFO ] Flow matrix only has 128 transitions (discarded 988 similar events)
[2024-05-24 15:11:12] [INFO ] Invariant cache hit.
[2024-05-24 15:11:12] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/214 places, 1116/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 97/214 places, 1116/1224 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s19 1), p0:(AND (GEQ s73 1) (GEQ s92 1))], 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 232 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Computed a total of 97 stabilizing places and 1116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 97 transition count 1116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-09 finished in 1141 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(G((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 104 place count 155 transition count 1166
Iterating global reduction 1 with 13 rules applied. Total rules applied 117 place count 155 transition count 1166
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 125 place count 147 transition count 1166
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 143 place count 129 transition count 1148
Iterating global reduction 2 with 18 rules applied. Total rules applied 161 place count 129 transition count 1148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 170 place count 120 transition count 1139
Iterating global reduction 2 with 9 rules applied. Total rules applied 179 place count 120 transition count 1139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 112 transition count 1131
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 112 transition count 1131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 203 place count 104 transition count 1123
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 104 transition count 1123
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 220 place count 95 transition count 1114
Iterating global reduction 2 with 9 rules applied. Total rules applied 229 place count 95 transition count 1114
Applied a total of 229 rules in 33 ms. Remains 95 /214 variables (removed 119) and now considering 1114/1224 (removed 110) transitions.
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 113 transitions (discarded 1001 similar events)
// Phase 1: matrix 113 rows 95 cols
[2024-05-24 15:11:13] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:11:13] [INFO ] Implicit Places using invariants in 101 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/214 places, 1114/1224 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 1111
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 1111
Applied a total of 6 rules in 7 ms. Remains 91 /94 variables (removed 3) and now considering 1111/1114 (removed 3) transitions.
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 109 transitions (discarded 1002 similar events)
// Phase 1: matrix 109 rows 91 cols
[2024-05-24 15:11:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:11:13] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 109 transitions (discarded 1002 similar events)
[2024-05-24 15:11:13] [INFO ] Invariant cache hit.
[2024-05-24 15:11:13] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/214 places, 1111/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 91/214 places, 1111/1224 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (LT s60 1) (NOT (AND (GEQ s16 1) (GEQ s85 1)))), p1:(AND (GEQ s16 1) (GEQ s85 1)), p0:(LT s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8962 steps with 493 reset in 28 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-10 finished in 586 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' '!(!(p0 U G(F(G(((p0 U p1)||p0))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Graph (complete) has 1746 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 213 transition count 1184
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 174 transition count 1184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 79 place count 174 transition count 1171
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 105 place count 161 transition count 1171
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 146 transition count 1156
Iterating global reduction 2 with 15 rules applied. Total rules applied 135 place count 146 transition count 1156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 144 transition count 1154
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 144 transition count 1154
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 143 transition count 1154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 143 transition count 1153
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 142 place count 142 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 141 transition count 1152
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 141 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 140 transition count 1151
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 140 transition count 1151
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 198 place count 114 transition count 1125
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 105 transition count 1116
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 105 transition count 1116
Applied a total of 216 rules in 123 ms. Remains 105 /214 variables (removed 109) and now considering 1116/1224 (removed 108) transitions.
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 224 transitions (discarded 892 similar events)
// Phase 1: matrix 224 rows 105 cols
[2024-05-24 15:11:13] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 15:11:13] [INFO ] Implicit Places using invariants in 107 ms returned [3, 8, 14, 26, 34, 37, 64, 70, 89]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 110 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/214 places, 1116/1224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 1109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 1109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 83 transition count 1103
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 83 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 81 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 81 transition count 1101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 75 transition count 1095
Applied a total of 42 rules in 47 ms. Remains 75 /96 variables (removed 21) and now considering 1095/1116 (removed 21) transitions.
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 75 cols
[2024-05-24 15:11:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:11:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-24 15:11:13] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
[2024-05-24 15:11:13] [INFO ] Invariant cache hit.
[2024-05-24 15:11:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/214 places, 1095/1224 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 505 ms. Remains : 75/214 places, 1095/1224 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR p0 p1), (OR p1 p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s25 1)), p1:(GEQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12367 reset in 247 ms.
Product exploration explored 100000 steps with 12375 reset in 274 ms.
Computed a total of 75 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 1095
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-11 finished in 1329 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)||X((X(p1) U ((X(p1)&&G((p0 U p2)))||X(G(p1)))))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 104 place count 155 transition count 1166
Iterating global reduction 1 with 13 rules applied. Total rules applied 117 place count 155 transition count 1166
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 125 place count 147 transition count 1166
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 143 place count 129 transition count 1148
Iterating global reduction 2 with 18 rules applied. Total rules applied 161 place count 129 transition count 1148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 170 place count 120 transition count 1139
Iterating global reduction 2 with 9 rules applied. Total rules applied 179 place count 120 transition count 1139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 188 place count 111 transition count 1130
Iterating global reduction 2 with 9 rules applied. Total rules applied 197 place count 111 transition count 1130
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 206 place count 102 transition count 1121
Iterating global reduction 2 with 9 rules applied. Total rules applied 215 place count 102 transition count 1121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 226 place count 91 transition count 1110
Iterating global reduction 2 with 11 rules applied. Total rules applied 237 place count 91 transition count 1110
Applied a total of 237 rules in 34 ms. Remains 91 /214 variables (removed 123) and now considering 1110/1224 (removed 114) transitions.
[2024-05-24 15:11:14] [INFO ] Flow matrix only has 93 transitions (discarded 1017 similar events)
// Phase 1: matrix 93 rows 91 cols
[2024-05-24 15:11:14] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:11:15] [INFO ] Implicit Places using invariants in 94 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/214 places, 1110/1224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 1108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 1108
Applied a total of 4 rules in 6 ms. Remains 88 /90 variables (removed 2) and now considering 1108/1110 (removed 2) transitions.
[2024-05-24 15:11:15] [INFO ] Flow matrix only has 90 transitions (discarded 1018 similar events)
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 15:11:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:11:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 15:11:15] [INFO ] Flow matrix only has 90 transitions (discarded 1018 similar events)
[2024-05-24 15:11:15] [INFO ] Invariant cache hit.
[2024-05-24 15:11:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/214 places, 1108/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 88/214 places, 1108/1224 transitions.
Stuttering acceptance computed with spot in 1538 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(GEQ s57 1), p2:(AND (GEQ s63 1) (GEQ s80 1)), p1:(GEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-12 finished in 1933 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||G(p1)))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Graph (complete) has 1746 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 213 transition count 1185
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 175 transition count 1185
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 77 place count 175 transition count 1171
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 105 place count 161 transition count 1171
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 121 place count 145 transition count 1155
Iterating global reduction 2 with 16 rules applied. Total rules applied 137 place count 145 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 143 transition count 1153
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 143 transition count 1153
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 142 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 142 transition count 1152
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 144 place count 141 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 140 transition count 1151
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 140 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 139 transition count 1150
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 139 transition count 1150
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 198 place count 114 transition count 1125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 205 place count 107 transition count 1118
Iterating global reduction 3 with 7 rules applied. Total rules applied 212 place count 107 transition count 1118
Applied a total of 212 rules in 61 ms. Remains 107 /214 variables (removed 107) and now considering 1118/1224 (removed 106) transitions.
[2024-05-24 15:11:16] [INFO ] Flow matrix only has 225 transitions (discarded 893 similar events)
// Phase 1: matrix 225 rows 107 cols
[2024-05-24 15:11:16] [INFO ] Computed 11 invariants in 4 ms
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants in 107 ms returned [3, 8, 14, 26, 34, 37, 91]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 110 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/214 places, 1118/1224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 1113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 1113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 91 transition count 1109
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 91 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 90 transition count 1108
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 90 transition count 1108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 85 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 83 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 83 transition count 1101
Applied a total of 34 rules in 31 ms. Remains 83 /100 variables (removed 17) and now considering 1101/1118 (removed 17) transitions.
[2024-05-24 15:11:17] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
// Phase 1: matrix 111 rows 83 cols
[2024-05-24 15:11:17] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 15:11:17] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
[2024-05-24 15:11:17] [INFO ] Invariant cache hit.
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/214 places, 1101/1224 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 442 ms. Remains : 83/214 places, 1101/1224 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-14 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=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s52 1), p0:(GEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-14 finished in 548 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)||X(X((p1&&F(p2))))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 1224/1224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 191 transition count 1201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 191 transition count 1201
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 169 transition count 1179
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 169 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 1179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 103 place count 156 transition count 1167
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 156 transition count 1167
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 122 place count 149 transition count 1167
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 138 place count 133 transition count 1151
Iterating global reduction 2 with 16 rules applied. Total rules applied 154 place count 133 transition count 1151
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 125 transition count 1143
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 125 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 117 transition count 1135
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 117 transition count 1135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 194 place count 109 transition count 1127
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 109 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 100 transition count 1118
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 100 transition count 1118
Applied a total of 220 rules in 29 ms. Remains 100 /214 variables (removed 114) and now considering 1118/1224 (removed 106) transitions.
[2024-05-24 15:11:17] [INFO ] Flow matrix only has 116 transitions (discarded 1002 similar events)
// Phase 1: matrix 116 rows 100 cols
[2024-05-24 15:11:17] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants in 100 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/214 places, 1118/1224 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 1115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 1115
Applied a total of 6 rules in 5 ms. Remains 96 /99 variables (removed 3) and now considering 1115/1118 (removed 3) transitions.
[2024-05-24 15:11:17] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2024-05-24 15:11:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-24 15:11:17] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
[2024-05-24 15:11:17] [INFO ] Invariant cache hit.
[2024-05-24 15:11:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/214 places, 1115/1224 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 96/214 places, 1115/1224 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s24 1) (GEQ s25 1) (GEQ s82 1)), p1:(OR (LT s24 1) (LT s25 1)), p2:(LT s84 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 6 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-15 finished in 622 ms.
All properties solved by simple procedures.
Total runtime 20293 ms.

BK_STOP 1716563483586

--------------------
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="LeafsetExtension-PT-S32C2"
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 LeafsetExtension-PT-S32C2, 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 r241-tall-171649628400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C2.tgz
mv LeafsetExtension-PT-S32C2 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 ;