fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419000500
Last Updated
May 14, 2023

About the Execution of LTSMin+red for LeafsetExtension-PT-S32C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
760.775 21987.00 43551.00 344.90 FFFTFFFTTTTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 14K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679538670920

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 02:31:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 02:31:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 02:31:12] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2023-03-23 02:31:12] [INFO ] Transformed 5622 places.
[2023-03-23 02:31:12] [INFO ] Transformed 5449 transitions.
[2023-03-23 02:31:12] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 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 976 places :
Symmetric choice reduction at 1 with 976 rule applications. Total rules 4163 place count 2506 transition count 3426
Iterating global reduction 1 with 976 rules applied. Total rules applied 5139 place count 2506 transition count 3426
Discarding 970 places :
Symmetric choice reduction at 1 with 970 rule applications. Total rules 6109 place count 1536 transition count 2456
Iterating global reduction 1 with 970 rules applied. Total rules applied 7079 place count 1536 transition count 2456
Discarding 48 places :
Implicit places reduction removed 48 places
Iterating post reduction 1 with 48 rules applied. Total rules applied 7127 place count 1488 transition count 2456
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 7173 place count 1442 transition count 2410
Iterating global reduction 2 with 46 rules applied. Total rules applied 7219 place count 1442 transition count 2410
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 7265 place count 1396 transition count 2364
Iterating global reduction 2 with 46 rules applied. Total rules applied 7311 place count 1396 transition count 2364
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 7357 place count 1350 transition count 2318
Iterating global reduction 2 with 46 rules applied. Total rules applied 7403 place count 1350 transition count 2318
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 7449 place count 1304 transition count 2272
Iterating global reduction 2 with 46 rules applied. Total rules applied 7495 place count 1304 transition count 2272
Discarding 703 places :
Symmetric choice reduction at 2 with 703 rule applications. Total rules 8198 place count 601 transition count 1569
Iterating global reduction 2 with 703 rules applied. Total rules applied 8901 place count 601 transition count 1569
Applied a total of 8901 rules in 2237 ms. Remains 601 /5622 variables (removed 5021) and now considering 1569/5449 (removed 3880) transitions.
[2023-03-23 02:31:15] [INFO ] Flow matrix only has 868 transitions (discarded 701 similar events)
// Phase 1: matrix 868 rows 601 cols
[2023-03-23 02:31:15] [INFO ] Computed 54 place invariants in 46 ms
[2023-03-23 02:31:16] [INFO ] Implicit Places using invariants in 614 ms returned [46, 94, 98, 103, 107, 127, 132, 157, 162, 186, 208, 213, 217, 225, 230, 250, 278, 280, 306, 310, 314, 340, 345, 349, 369, 374, 402, 406, 410, 430, 479, 517, 543, 571, 575]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 643 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 566/5622 places, 1569/5449 transitions.
Discarding 275 places :
Symmetric choice reduction at 0 with 275 rule applications. Total rules 275 place count 291 transition count 1294
Iterating global reduction 0 with 275 rules applied. Total rules applied 550 place count 291 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 555 place count 286 transition count 1289
Iterating global reduction 0 with 5 rules applied. Total rules applied 560 place count 286 transition count 1289
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 565 place count 281 transition count 1284
Iterating global reduction 0 with 5 rules applied. Total rules applied 570 place count 281 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 575 place count 276 transition count 1279
Iterating global reduction 0 with 5 rules applied. Total rules applied 580 place count 276 transition count 1279
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 595 place count 261 transition count 1264
Iterating global reduction 0 with 15 rules applied. Total rules applied 610 place count 261 transition count 1264
Applied a total of 610 rules in 47 ms. Remains 261 /566 variables (removed 305) and now considering 1264/1569 (removed 305) transitions.
[2023-03-23 02:31:16] [INFO ] Flow matrix only has 462 transitions (discarded 802 similar events)
// Phase 1: matrix 462 rows 261 cols
[2023-03-23 02:31:16] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-23 02:31:16] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-23 02:31:16] [INFO ] Flow matrix only has 462 transitions (discarded 802 similar events)
[2023-03-23 02:31:16] [INFO ] Invariant cache hit.
[2023-03-23 02:31:16] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/5622 places, 1264/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3612 ms. Remains : 261/5622 places, 1264/5449 transitions.
Support contains 45 out of 261 places after structural reductions.
[2023-03-23 02:31:17] [INFO ] Flatten gal took : 105 ms
[2023-03-23 02:31:17] [INFO ] Flatten gal took : 66 ms
[2023-03-23 02:31:17] [INFO ] Input system was already deterministic with 1264 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 02:31:17] [INFO ] Flow matrix only has 462 transitions (discarded 802 similar events)
[2023-03-23 02:31:17] [INFO ] Invariant cache hit.
[2023-03-23 02:31:17] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-23 02:31:17] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 02:31:17] [INFO ] After 135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-23 02:31:18] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Graph (complete) has 835 edges and 261 vertex of which 50 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.4 ms
Discarding 211 places :
Also discarding 394 output transitions
Drop transitions removed 394 transitions
Drop transitions removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 589 rules applied. Total rules applied 590 place count 48 transition count 283
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 597 place count 45 transition count 279
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 601 place count 41 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 601 place count 41 transition count 278
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 603 place count 40 transition count 278
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 607 place count 38 transition count 276
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 623 place count 38 transition count 260
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 639 place count 22 transition count 260
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 654 place count 22 transition count 260
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 655 place count 21 transition count 260
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 656 place count 21 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 657 place count 20 transition count 259
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 672 place count 20 transition count 244
Applied a total of 672 rules in 62 ms. Remains 20 /261 variables (removed 241) and now considering 244/1264 (removed 1020) transitions.
[2023-03-23 02:31:18] [INFO ] Flow matrix only has 35 transitions (discarded 209 similar events)
// Phase 1: matrix 35 rows 20 cols
[2023-03-23 02:31:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-23 02:31:18] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 20/261 places, 244/1264 transitions.
Finished random walk after 7175 steps, including 2258 resets, run visited all 1 properties in 58 ms. (steps per millisecond=123 )
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 261 stabilizing places and 1264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 261 transition count 1264
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 1244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 1244
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 223 transition count 1226
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 223 transition count 1226
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 219 transition count 1226
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 95 place count 204 transition count 1211
Iterating global reduction 1 with 15 rules applied. Total rules applied 110 place count 204 transition count 1211
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 117 place count 197 transition count 1211
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 135 place count 179 transition count 1193
Iterating global reduction 2 with 18 rules applied. Total rules applied 153 place count 179 transition count 1193
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 168 transition count 1182
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 168 transition count 1182
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 157 transition count 1171
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 157 transition count 1171
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 215 place count 139 transition count 1153
Iterating global reduction 2 with 18 rules applied. Total rules applied 233 place count 139 transition count 1153
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 253 place count 119 transition count 1133
Iterating global reduction 2 with 20 rules applied. Total rules applied 273 place count 119 transition count 1133
Applied a total of 273 rules in 40 ms. Remains 119 /261 variables (removed 142) and now considering 1133/1264 (removed 131) transitions.
[2023-03-23 02:31:18] [INFO ] Flow matrix only has 149 transitions (discarded 984 similar events)
// Phase 1: matrix 149 rows 119 cols
[2023-03-23 02:31:18] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-23 02:31:19] [INFO ] Implicit Places using invariants in 256 ms returned [19, 53, 96, 100]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 259 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/261 places, 1133/1264 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 1121
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 1121
Applied a total of 24 rules in 18 ms. Remains 103 /115 variables (removed 12) and now considering 1121/1133 (removed 12) transitions.
[2023-03-23 02:31:19] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
// Phase 1: matrix 133 rows 103 cols
[2023-03-23 02:31:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 02:31:19] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-23 02:31:19] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
[2023-03-23 02:31:19] [INFO ] Invariant cache hit.
[2023-03-23 02:31:19] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/261 places, 1121/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 791 ms. Remains : 103/261 places, 1121/1264 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s35 1) (GEQ s37 1)), p1:(LT s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 373 steps with 20 reset in 4 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-00 finished in 1075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 6 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 1245
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 1245
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 225 transition count 1228
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 225 transition count 1228
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 221 transition count 1228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 91 place count 206 transition count 1213
Iterating global reduction 1 with 15 rules applied. Total rules applied 106 place count 206 transition count 1213
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 113 place count 199 transition count 1213
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 131 place count 181 transition count 1195
Iterating global reduction 2 with 18 rules applied. Total rules applied 149 place count 181 transition count 1195
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 160 place count 170 transition count 1184
Iterating global reduction 2 with 11 rules applied. Total rules applied 171 place count 170 transition count 1184
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 182 place count 159 transition count 1173
Iterating global reduction 2 with 11 rules applied. Total rules applied 193 place count 159 transition count 1173
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 211 place count 141 transition count 1155
Iterating global reduction 2 with 18 rules applied. Total rules applied 229 place count 141 transition count 1155
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 250 place count 120 transition count 1134
Iterating global reduction 2 with 21 rules applied. Total rules applied 271 place count 120 transition count 1134
Applied a total of 271 rules in 54 ms. Remains 120 /261 variables (removed 141) and now considering 1134/1264 (removed 130) transitions.
[2023-03-23 02:31:19] [INFO ] Flow matrix only has 151 transitions (discarded 983 similar events)
// Phase 1: matrix 151 rows 120 cols
[2023-03-23 02:31:19] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-23 02:31:19] [INFO ] Implicit Places using invariants in 116 ms returned [19, 53, 97, 101]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 118 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/261 places, 1134/1264 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 105 transition count 1123
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 105 transition count 1123
Applied a total of 22 rules in 6 ms. Remains 105 /116 variables (removed 11) and now considering 1123/1134 (removed 11) transitions.
[2023-03-23 02:31:19] [INFO ] Flow matrix only has 136 transitions (discarded 987 similar events)
// Phase 1: matrix 136 rows 105 cols
[2023-03-23 02:31:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 02:31:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-23 02:31:20] [INFO ] Flow matrix only has 136 transitions (discarded 987 similar events)
[2023-03-23 02:31:20] [INFO ] Invariant cache hit.
[2023-03-23 02:31:20] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/261 places, 1123/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 445 ms. Remains : 105/261 places, 1123/1264 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s49 1) (AND (GEQ s31 1) (GEQ s33 1) (LT s82 1))), p1:(AND (GEQ s63 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-01 finished in 668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 1243
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 221 transition count 1224
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 221 transition count 1224
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 217 transition count 1224
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 201 transition count 1208
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 201 transition count 1208
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 124 place count 193 transition count 1208
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 144 place count 173 transition count 1188
Iterating global reduction 2 with 20 rules applied. Total rules applied 164 place count 173 transition count 1188
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 176 place count 161 transition count 1176
Iterating global reduction 2 with 12 rules applied. Total rules applied 188 place count 161 transition count 1176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 200 place count 149 transition count 1164
Iterating global reduction 2 with 12 rules applied. Total rules applied 212 place count 149 transition count 1164
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 231 place count 130 transition count 1145
Iterating global reduction 2 with 19 rules applied. Total rules applied 250 place count 130 transition count 1145
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 273 place count 107 transition count 1122
Iterating global reduction 2 with 23 rules applied. Total rules applied 296 place count 107 transition count 1122
Applied a total of 296 rules in 42 ms. Remains 107 /261 variables (removed 154) and now considering 1122/1264 (removed 142) transitions.
[2023-03-23 02:31:20] [INFO ] Flow matrix only has 122 transitions (discarded 1000 similar events)
// Phase 1: matrix 122 rows 107 cols
[2023-03-23 02:31:20] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-23 02:31:20] [INFO ] Implicit Places using invariants in 124 ms returned [29, 53, 85, 89]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 126 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/261 places, 1122/1264 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 93 transition count 1112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 93 transition count 1112
Applied a total of 20 rules in 17 ms. Remains 93 /103 variables (removed 10) and now considering 1112/1122 (removed 10) transitions.
[2023-03-23 02:31:20] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
// Phase 1: matrix 108 rows 93 cols
[2023-03-23 02:31:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 02:31:20] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-23 02:31:20] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
[2023-03-23 02:31:20] [INFO ] Invariant cache hit.
[2023-03-23 02:31:20] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/261 places, 1112/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 491 ms. Remains : 93/261 places, 1112/1264 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s76 1) (GEQ s79 1)), p1:(AND (GEQ s19 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-02 finished in 701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G(!p1))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 1243
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 220 transition count 1223
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 220 transition count 1223
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 87 place count 215 transition count 1223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 105 place count 197 transition count 1205
Iterating global reduction 1 with 18 rules applied. Total rules applied 123 place count 197 transition count 1205
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 131 place count 189 transition count 1205
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 152 place count 168 transition count 1184
Iterating global reduction 2 with 21 rules applied. Total rules applied 173 place count 168 transition count 1184
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 186 place count 155 transition count 1171
Iterating global reduction 2 with 13 rules applied. Total rules applied 199 place count 155 transition count 1171
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 211 place count 143 transition count 1159
Iterating global reduction 2 with 12 rules applied. Total rules applied 223 place count 143 transition count 1159
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 244 place count 122 transition count 1138
Iterating global reduction 2 with 21 rules applied. Total rules applied 265 place count 122 transition count 1138
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 285 place count 102 transition count 1118
Iterating global reduction 2 with 20 rules applied. Total rules applied 305 place count 102 transition count 1118
Applied a total of 305 rules in 37 ms. Remains 102 /261 variables (removed 159) and now considering 1118/1264 (removed 146) transitions.
[2023-03-23 02:31:21] [INFO ] Flow matrix only has 119 transitions (discarded 999 similar events)
// Phase 1: matrix 119 rows 102 cols
[2023-03-23 02:31:21] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 02:31:21] [INFO ] Implicit Places using invariants in 117 ms returned [43, 80, 85]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/261 places, 1118/1264 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 1110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 1110
Applied a total of 16 rules in 6 ms. Remains 91 /99 variables (removed 8) and now considering 1110/1118 (removed 8) transitions.
[2023-03-23 02:31:21] [INFO ] Flow matrix only has 108 transitions (discarded 1002 similar events)
// Phase 1: matrix 108 rows 91 cols
[2023-03-23 02:31:21] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 02:31:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-23 02:31:21] [INFO ] Flow matrix only has 108 transitions (discarded 1002 similar events)
[2023-03-23 02:31:21] [INFO ] Invariant cache hit.
[2023-03-23 02:31:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/261 places, 1110/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 442 ms. Remains : 91/261 places, 1110/1264 transitions.
Stuttering acceptance computed with spot in 117 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s16 1) (GEQ s74 1)), p1:(AND (GEQ s69 1) (GEQ s87 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 50000 reset in 416 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Computed a total of 91 stabilizing places and 1110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 91 transition count 1110
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)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 6 factoid took 276 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-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-03 finished in 1838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Graph (complete) has 1941 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 260 transition count 1234
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 231 transition count 1234
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 59 place count 231 transition count 1219
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 89 place count 216 transition count 1219
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 203 transition count 1206
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 203 transition count 1206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 198 transition count 1201
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 198 transition count 1201
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 129 place count 194 transition count 1201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 129 place count 194 transition count 1197
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 190 transition count 1197
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 186 transition count 1193
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 186 transition count 1193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 182 transition count 1189
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 182 transition count 1189
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 171 transition count 1178
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 171 transition count 1178
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 239 place count 139 transition count 1146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 131 transition count 1138
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 131 transition count 1138
Applied a total of 255 rules in 168 ms. Remains 131 /261 variables (removed 130) and now considering 1138/1264 (removed 126) transitions.
[2023-03-23 02:31:23] [INFO ] Flow matrix only has 264 transitions (discarded 874 similar events)
// Phase 1: matrix 264 rows 131 cols
[2023-03-23 02:31:23] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-23 02:31:23] [INFO ] Implicit Places using invariants in 157 ms returned [11, 35, 42, 50, 60, 72, 82, 85, 92, 96, 105, 111]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 161 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/261 places, 1138/1264 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 105 transition count 1124
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 105 transition count 1124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 98 transition count 1117
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 98 transition count 1117
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 88 transition count 1107
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 88 transition count 1107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 82 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 80 transition count 1099
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 80 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 79 transition count 1098
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 79 transition count 1098
Applied a total of 80 rules in 74 ms. Remains 79 /119 variables (removed 40) and now considering 1098/1138 (removed 40) transitions.
[2023-03-23 02:31:23] [INFO ] Flow matrix only has 79 transitions (discarded 1019 similar events)
// Phase 1: matrix 79 rows 79 cols
[2023-03-23 02:31:23] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 02:31:23] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-23 02:31:23] [INFO ] Flow matrix only has 79 transitions (discarded 1019 similar events)
[2023-03-23 02:31:23] [INFO ] Invariant cache hit.
[2023-03-23 02:31:23] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/261 places, 1098/1264 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 659 ms. Remains : 79/261 places, 1098/1264 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s36 1), p1:(AND (GEQ s64 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-05 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 1243
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 221 transition count 1224
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 221 transition count 1224
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 85 place count 216 transition count 1224
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 103 place count 198 transition count 1206
Iterating global reduction 1 with 18 rules applied. Total rules applied 121 place count 198 transition count 1206
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 129 place count 190 transition count 1206
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 150 place count 169 transition count 1185
Iterating global reduction 2 with 21 rules applied. Total rules applied 171 place count 169 transition count 1185
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 184 place count 156 transition count 1172
Iterating global reduction 2 with 13 rules applied. Total rules applied 197 place count 156 transition count 1172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 210 place count 143 transition count 1159
Iterating global reduction 2 with 13 rules applied. Total rules applied 223 place count 143 transition count 1159
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 245 place count 121 transition count 1137
Iterating global reduction 2 with 22 rules applied. Total rules applied 267 place count 121 transition count 1137
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 290 place count 98 transition count 1114
Iterating global reduction 2 with 23 rules applied. Total rules applied 313 place count 98 transition count 1114
Applied a total of 313 rules in 30 ms. Remains 98 /261 variables (removed 163) and now considering 1114/1264 (removed 150) transitions.
[2023-03-23 02:31:23] [INFO ] Flow matrix only has 99 transitions (discarded 1015 similar events)
// Phase 1: matrix 99 rows 98 cols
[2023-03-23 02:31:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 02:31:23] [INFO ] Implicit Places using invariants in 128 ms returned [19, 43, 77, 81]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 143 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/261 places, 1114/1264 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 86 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 86 transition count 1106
Applied a total of 16 rules in 8 ms. Remains 86 /94 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
[2023-03-23 02:31:23] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2023-03-23 02:31:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 02:31:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-23 02:31:24] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
[2023-03-23 02:31:24] [INFO ] Invariant cache hit.
[2023-03-23 02:31:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/261 places, 1106/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 441 ms. Remains : 86/261 places, 1106/1264 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s63 1), p0:(OR (LT s18 1) (LT s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5522 reset in 214 ms.
Product exploration explored 100000 steps with 5513 reset in 258 ms.
Computed a total of 86 stabilizing places and 1106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 1106
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) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-07 finished in 1402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 1243
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 221 transition count 1224
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 221 transition count 1224
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 85 place count 216 transition count 1224
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 199 transition count 1207
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 199 transition count 1207
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 192 transition count 1207
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 145 place count 173 transition count 1188
Iterating global reduction 2 with 19 rules applied. Total rules applied 164 place count 173 transition count 1188
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 176 place count 161 transition count 1176
Iterating global reduction 2 with 12 rules applied. Total rules applied 188 place count 161 transition count 1176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 200 place count 149 transition count 1164
Iterating global reduction 2 with 12 rules applied. Total rules applied 212 place count 149 transition count 1164
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 233 place count 128 transition count 1143
Iterating global reduction 2 with 21 rules applied. Total rules applied 254 place count 128 transition count 1143
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 274 place count 108 transition count 1123
Iterating global reduction 2 with 20 rules applied. Total rules applied 294 place count 108 transition count 1123
Applied a total of 294 rules in 35 ms. Remains 108 /261 variables (removed 153) and now considering 1123/1264 (removed 141) transitions.
[2023-03-23 02:31:25] [INFO ] Flow matrix only has 123 transitions (discarded 1000 similar events)
// Phase 1: matrix 123 rows 108 cols
[2023-03-23 02:31:25] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 02:31:25] [INFO ] Implicit Places using invariants in 112 ms returned [19, 43, 86, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/261 places, 1123/1264 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 94 transition count 1113
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 94 transition count 1113
Applied a total of 20 rules in 6 ms. Remains 94 /104 variables (removed 10) and now considering 1113/1123 (removed 10) transitions.
[2023-03-23 02:31:25] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
// Phase 1: matrix 109 rows 94 cols
[2023-03-23 02:31:25] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-23 02:31:25] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-23 02:31:25] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
[2023-03-23 02:31:25] [INFO ] Invariant cache hit.
[2023-03-23 02:31:25] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/261 places, 1113/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 94/261 places, 1113/1264 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 299 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-08 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 1242
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 1242
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 64 place count 219 transition count 1222
Iterating global reduction 0 with 20 rules applied. Total rules applied 84 place count 219 transition count 1222
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 214 transition count 1222
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 196 transition count 1204
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 196 transition count 1204
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 188 transition count 1204
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 154 place count 167 transition count 1183
Iterating global reduction 2 with 21 rules applied. Total rules applied 175 place count 167 transition count 1183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 188 place count 154 transition count 1170
Iterating global reduction 2 with 13 rules applied. Total rules applied 201 place count 154 transition count 1170
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 214 place count 141 transition count 1157
Iterating global reduction 2 with 13 rules applied. Total rules applied 227 place count 141 transition count 1157
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 249 place count 119 transition count 1135
Iterating global reduction 2 with 22 rules applied. Total rules applied 271 place count 119 transition count 1135
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 294 place count 96 transition count 1112
Iterating global reduction 2 with 23 rules applied. Total rules applied 317 place count 96 transition count 1112
Applied a total of 317 rules in 33 ms. Remains 96 /261 variables (removed 165) and now considering 1112/1264 (removed 152) transitions.
[2023-03-23 02:31:26] [INFO ] Flow matrix only has 96 transitions (discarded 1016 similar events)
// Phase 1: matrix 96 rows 96 cols
[2023-03-23 02:31:26] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 02:31:26] [INFO ] Implicit Places using invariants in 107 ms returned [19, 43, 75, 79]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/261 places, 1112/1264 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 1104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 1104
Applied a total of 16 rules in 7 ms. Remains 84 /92 variables (removed 8) and now considering 1104/1112 (removed 8) transitions.
[2023-03-23 02:31:26] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
// Phase 1: matrix 84 rows 84 cols
[2023-03-23 02:31:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 02:31:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-23 02:31:26] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
[2023-03-23 02:31:26] [INFO ] Invariant cache hit.
[2023-03-23 02:31:26] [INFO ] Implicit Places using invariants and state equation in 129 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 : 84/261 places, 1104/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 84/261 places, 1104/1264 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-09 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 s20 1) (LT s27 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 32098 reset in 303 ms.
Product exploration explored 100000 steps with 32120 reset in 344 ms.
Computed a total of 84 stabilizing places and 1104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 1104
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, (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 110 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-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-09 finished in 1419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(F(p1))||(F(p1)&&X(p2))))||p0))))'
Support contains 6 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Graph (complete) has 1941 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 260 transition count 1236
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 233 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 232 transition count 1235
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 57 place count 232 transition count 1220
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 87 place count 217 transition count 1220
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 99 place count 205 transition count 1208
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 205 transition count 1208
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 201 transition count 1204
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 201 transition count 1204
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 197 transition count 1204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 123 place count 197 transition count 1200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 131 place count 193 transition count 1200
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 189 transition count 1196
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 189 transition count 1196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 185 transition count 1192
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 185 transition count 1192
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 157 place count 175 transition count 1182
Iterating global reduction 4 with 10 rules applied. Total rules applied 167 place count 175 transition count 1182
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 231 place count 143 transition count 1150
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 238 place count 136 transition count 1143
Iterating global reduction 4 with 7 rules applied. Total rules applied 245 place count 136 transition count 1143
Applied a total of 245 rules in 103 ms. Remains 136 /261 variables (removed 125) and now considering 1143/1264 (removed 121) transitions.
[2023-03-23 02:31:28] [INFO ] Flow matrix only has 271 transitions (discarded 872 similar events)
// Phase 1: matrix 271 rows 136 cols
[2023-03-23 02:31:28] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-23 02:31:28] [INFO ] Implicit Places using invariants in 118 ms returned [11, 44, 50, 60, 85, 97, 105, 110, 116]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 119 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/261 places, 1143/1264 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 120 transition count 1136
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 120 transition count 1136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 115 transition count 1131
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 115 transition count 1131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 107 transition count 1123
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 107 transition count 1123
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 99 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 97 transition count 1113
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 97 transition count 1113
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 94 transition count 1110
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 94 transition count 1110
Applied a total of 66 rules in 37 ms. Remains 94 /127 variables (removed 33) and now considering 1110/1143 (removed 33) transitions.
[2023-03-23 02:31:28] [INFO ] Flow matrix only has 124 transitions (discarded 986 similar events)
// Phase 1: matrix 124 rows 94 cols
[2023-03-23 02:31:28] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 02:31:28] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-23 02:31:28] [INFO ] Flow matrix only has 124 transitions (discarded 986 similar events)
[2023-03-23 02:31:28] [INFO ] Invariant cache hit.
[2023-03-23 02:31:28] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/261 places, 1110/1264 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 583 ms. Remains : 94/261 places, 1110/1264 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s58 1) (LT s61 1)), p1:(OR (NOT (AND (GEQ s21 1) (GEQ s33 1))) (NOT (AND (GEQ s14 1) (GEQ s76 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 10297 reset in 285 ms.
Product exploration explored 100000 steps with 10281 reset in 294 ms.
Computed a total of 94 stabilizing places and 1110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 1110
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) (NOT p1)))), (X (X (NOT (AND p0 (NOT 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 :(F (G p0))
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-10 finished in 1558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(F(p0) U p1)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Graph (complete) has 1941 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 260 transition count 1235
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 232 transition count 1235
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 232 transition count 1221
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 218 transition count 1221
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 98 place count 205 transition count 1208
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 205 transition count 1208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 200 transition count 1203
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 200 transition count 1203
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 196 transition count 1203
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 125 place count 196 transition count 1199
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 192 transition count 1199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 188 transition count 1195
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 188 transition count 1195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 184 transition count 1191
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 184 transition count 1191
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 158 place count 175 transition count 1182
Iterating global reduction 3 with 9 rules applied. Total rules applied 167 place count 175 transition count 1182
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 233 place count 142 transition count 1149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 242 place count 133 transition count 1140
Iterating global reduction 3 with 9 rules applied. Total rules applied 251 place count 133 transition count 1140
Applied a total of 251 rules in 71 ms. Remains 133 /261 variables (removed 128) and now considering 1140/1264 (removed 124) transitions.
[2023-03-23 02:31:29] [INFO ] Flow matrix only has 267 transitions (discarded 873 similar events)
// Phase 1: matrix 267 rows 133 cols
[2023-03-23 02:31:29] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-23 02:31:29] [INFO ] Implicit Places using invariants in 138 ms returned [11, 35, 42, 48, 74, 84, 87, 94, 98, 102, 107, 113]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 143 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/261 places, 1140/1264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 101 transition count 1120
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 101 transition count 1120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 95 transition count 1114
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 95 transition count 1114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 89 transition count 1108
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 89 transition count 1108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 82 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 80 transition count 1099
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 80 transition count 1099
Applied a total of 82 rules in 36 ms. Remains 80 /121 variables (removed 41) and now considering 1099/1140 (removed 41) transitions.
[2023-03-23 02:31:29] [INFO ] Flow matrix only has 94 transitions (discarded 1005 similar events)
// Phase 1: matrix 94 rows 80 cols
[2023-03-23 02:31:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 02:31:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-23 02:31:29] [INFO ] Flow matrix only has 94 transitions (discarded 1005 similar events)
[2023-03-23 02:31:29] [INFO ] Invariant cache hit.
[2023-03-23 02:31:29] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/261 places, 1099/1264 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 494 ms. Remains : 80/261 places, 1099/1264 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s44 1), p1:(AND (GEQ s51 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-11 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)&&F(G(p1))))) U G((p0&&X(p2)))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 1245
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 1245
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 225 transition count 1228
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 225 transition count 1228
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 220 transition count 1228
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 94 place count 203 transition count 1211
Iterating global reduction 1 with 17 rules applied. Total rules applied 111 place count 203 transition count 1211
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 118 place count 196 transition count 1211
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 137 place count 177 transition count 1192
Iterating global reduction 2 with 19 rules applied. Total rules applied 156 place count 177 transition count 1192
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 165 transition count 1180
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 165 transition count 1180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 192 place count 153 transition count 1168
Iterating global reduction 2 with 12 rules applied. Total rules applied 204 place count 153 transition count 1168
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 225 place count 132 transition count 1147
Iterating global reduction 2 with 21 rules applied. Total rules applied 246 place count 132 transition count 1147
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 266 place count 112 transition count 1127
Iterating global reduction 2 with 20 rules applied. Total rules applied 286 place count 112 transition count 1127
Applied a total of 286 rules in 35 ms. Remains 112 /261 variables (removed 149) and now considering 1127/1264 (removed 137) transitions.
[2023-03-23 02:31:30] [INFO ] Flow matrix only has 129 transitions (discarded 998 similar events)
// Phase 1: matrix 129 rows 112 cols
[2023-03-23 02:31:30] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 02:31:30] [INFO ] Implicit Places using invariants in 115 ms returned [19, 47, 90, 94]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/261 places, 1127/1264 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 1117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 1117
Applied a total of 20 rules in 6 ms. Remains 98 /108 variables (removed 10) and now considering 1117/1127 (removed 10) transitions.
[2023-03-23 02:31:30] [INFO ] Flow matrix only has 115 transitions (discarded 1002 similar events)
// Phase 1: matrix 115 rows 98 cols
[2023-03-23 02:31:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 02:31:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-23 02:31:30] [INFO ] Flow matrix only has 115 transitions (discarded 1002 similar events)
[2023-03-23 02:31:30] [INFO ] Invariant cache hit.
[2023-03-23 02:31:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/261 places, 1117/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 98/261 places, 1117/1264 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(GEQ s74 1), p2:(GEQ s23 1), p1:(GEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-14 finished in 830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p1)&&p0))))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 1264/1264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 1243
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 221 transition count 1224
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 221 transition count 1224
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 217 transition count 1224
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 200 transition count 1207
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 200 transition count 1207
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 126 place count 192 transition count 1207
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 146 place count 172 transition count 1187
Iterating global reduction 2 with 20 rules applied. Total rules applied 166 place count 172 transition count 1187
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 178 place count 160 transition count 1175
Iterating global reduction 2 with 12 rules applied. Total rules applied 190 place count 160 transition count 1175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 202 place count 148 transition count 1163
Iterating global reduction 2 with 12 rules applied. Total rules applied 214 place count 148 transition count 1163
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 233 place count 129 transition count 1144
Iterating global reduction 2 with 19 rules applied. Total rules applied 252 place count 129 transition count 1144
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 275 place count 106 transition count 1121
Iterating global reduction 2 with 23 rules applied. Total rules applied 298 place count 106 transition count 1121
Applied a total of 298 rules in 35 ms. Remains 106 /261 variables (removed 155) and now considering 1121/1264 (removed 143) transitions.
[2023-03-23 02:31:31] [INFO ] Flow matrix only has 121 transitions (discarded 1000 similar events)
// Phase 1: matrix 121 rows 106 cols
[2023-03-23 02:31:31] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-23 02:31:31] [INFO ] Implicit Places using invariants in 110 ms returned [19, 84, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 111 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/261 places, 1121/1264 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 1114
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 1114
Applied a total of 14 rules in 6 ms. Remains 96 /103 variables (removed 7) and now considering 1114/1121 (removed 7) transitions.
[2023-03-23 02:31:31] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 96 cols
[2023-03-23 02:31:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 02:31:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-23 02:31:31] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
[2023-03-23 02:31:31] [INFO ] Invariant cache hit.
[2023-03-23 02:31:31] [INFO ] Implicit Places using invariants and state equation in 153 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 : 96/261 places, 1114/1264 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 412 ms. Remains : 96/261 places, 1114/1264 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s38 1) (GEQ s64 1)), p1:(OR (AND (GEQ s66 1) (GEQ s68 1)) (AND (GEQ s38 1) (GEQ s64 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-15 finished in 680 ms.
All properties solved by simple procedures.
Total runtime 19239 ms.
ITS solved all properties within timeout

BK_STOP 1679538692907

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r233-tall-167856419000500"
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 ;