fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821000492
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for LeafsetExtension-PT-S16C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
311.680 10683.00 24131.00 300.20 FTFFFFFFFFFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821000492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S16C4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 16K Apr 29 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 29 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 905K May 10 09:34 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-S16C4-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S16C4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652796101816

Running Version 202205111006
[2022-05-17 14:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 14:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 14:01:43] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-17 14:01:43] [INFO ] Transformed 1542 places.
[2022-05-17 14:01:43] [INFO ] Transformed 1449 transitions.
[2022-05-17 14:01:43] [INFO ] Parsed PT model containing 1542 places and 1449 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 1249 transition count 1449
Discarding 266 places :
Symmetric choice reduction at 1 with 266 rule applications. Total rules 559 place count 983 transition count 1183
Iterating global reduction 1 with 266 rules applied. Total rules applied 825 place count 983 transition count 1183
Discarding 227 places :
Symmetric choice reduction at 1 with 227 rule applications. Total rules 1052 place count 756 transition count 956
Iterating global reduction 1 with 227 rules applied. Total rules applied 1279 place count 756 transition count 956
Discarding 223 places :
Symmetric choice reduction at 1 with 223 rule applications. Total rules 1502 place count 533 transition count 733
Iterating global reduction 1 with 223 rules applied. Total rules applied 1725 place count 533 transition count 733
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 1 with 20 rules applied. Total rules applied 1745 place count 513 transition count 733
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1763 place count 495 transition count 715
Iterating global reduction 2 with 18 rules applied. Total rules applied 1781 place count 495 transition count 715
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1798 place count 478 transition count 698
Iterating global reduction 2 with 17 rules applied. Total rules applied 1815 place count 478 transition count 698
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1832 place count 461 transition count 681
Iterating global reduction 2 with 17 rules applied. Total rules applied 1849 place count 461 transition count 681
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1866 place count 444 transition count 664
Iterating global reduction 2 with 17 rules applied. Total rules applied 1883 place count 444 transition count 664
Discarding 113 places :
Symmetric choice reduction at 2 with 113 rule applications. Total rules 1996 place count 331 transition count 551
Iterating global reduction 2 with 113 rules applied. Total rules applied 2109 place count 331 transition count 551
Applied a total of 2109 rules in 344 ms. Remains 331 /1542 variables (removed 1211) and now considering 551/1449 (removed 898) transitions.
[2022-05-17 14:01:43] [INFO ] Flow matrix only has 440 transitions (discarded 111 similar events)
// Phase 1: matrix 440 rows 331 cols
[2022-05-17 14:01:43] [INFO ] Computed 34 place invariants in 26 ms
[2022-05-17 14:01:44] [INFO ] Implicit Places using invariants in 388 ms returned [48, 58, 63, 75, 80, 92, 96, 130, 132, 168, 172, 205, 209, 223, 236, 256, 308]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 420 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/1542 places, 551/1449 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 225 transition count 462
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 225 transition count 462
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 182 place count 221 transition count 458
Iterating global reduction 0 with 4 rules applied. Total rules applied 186 place count 221 transition count 458
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 190 place count 217 transition count 454
Iterating global reduction 0 with 4 rules applied. Total rules applied 194 place count 217 transition count 454
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 198 place count 213 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 202 place count 213 transition count 450
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 213 place count 202 transition count 439
Iterating global reduction 0 with 11 rules applied. Total rules applied 224 place count 202 transition count 439
Applied a total of 224 rules in 64 ms. Remains 202 /314 variables (removed 112) and now considering 439/551 (removed 112) transitions.
[2022-05-17 14:01:44] [INFO ] Flow matrix only has 289 transitions (discarded 150 similar events)
// Phase 1: matrix 289 rows 202 cols
[2022-05-17 14:01:44] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 14:01:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2022-05-17 14:01:44] [INFO ] Flow matrix only has 289 transitions (discarded 150 similar events)
// Phase 1: matrix 289 rows 202 cols
[2022-05-17 14:01:44] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 14:01:44] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 202/1542 places, 439/1449 transitions.
Finished structural reductions, in 2 iterations. Remains : 202/1542 places, 439/1449 transitions.
Support contains 41 out of 202 places after structural reductions.
[2022-05-17 14:01:45] [INFO ] Flatten gal took : 55 ms
[2022-05-17 14:01:45] [INFO ] Flatten gal took : 27 ms
[2022-05-17 14:01:45] [INFO ] Input system was already deterministic with 439 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 14:01:45] [INFO ] Flow matrix only has 289 transitions (discarded 150 similar events)
// Phase 1: matrix 289 rows 202 cols
[2022-05-17 14:01:45] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 14:01:45] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-17 14:01:45] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 14:01:45] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 14:01:45] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 529 edges and 202 vertex of which 38 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.4 ms
Discarding 164 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Drop transitions removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 167 rules applied. Total rules applied 168 place count 37 transition count 145
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 68 rules applied. Total rules applied 236 place count 27 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 24 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 24 transition count 86
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 241 place count 23 transition count 86
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 245 place count 21 transition count 84
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 253 place count 21 transition count 76
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 260 place count 21 transition count 69
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 267 place count 14 transition count 69
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 273 place count 14 transition count 69
Applied a total of 273 rules in 42 ms. Remains 14 /202 variables (removed 188) and now considering 69/439 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/202 places, 69/439 transitions.
Finished random walk after 163 steps, including 27 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 202 stabilizing places and 439 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 439
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U F(p0))) U ((p0 U G(p1))&&G(p1)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 181 transition count 418
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 181 transition count 418
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 167 transition count 404
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 167 transition count 404
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 163 transition count 404
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 87 place count 150 transition count 391
Iterating global reduction 1 with 13 rules applied. Total rules applied 100 place count 150 transition count 391
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 105 place count 145 transition count 391
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 116 place count 134 transition count 380
Iterating global reduction 2 with 11 rules applied. Total rules applied 127 place count 134 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 125 transition count 371
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 125 transition count 371
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 116 transition count 362
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 116 transition count 362
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 180 place count 99 transition count 345
Iterating global reduction 2 with 17 rules applied. Total rules applied 197 place count 99 transition count 345
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 214 place count 82 transition count 328
Iterating global reduction 2 with 17 rules applied. Total rules applied 231 place count 82 transition count 328
Applied a total of 231 rules in 51 ms. Remains 82 /202 variables (removed 120) and now considering 328/439 (removed 111) transitions.
[2022-05-17 14:01:46] [INFO ] Flow matrix only has 95 transitions (discarded 233 similar events)
// Phase 1: matrix 95 rows 82 cols
[2022-05-17 14:01:46] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 14:01:46] [INFO ] Implicit Places using invariants in 229 ms returned [17, 23, 33, 48, 69]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 230 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/202 places, 328/439 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 65 transition count 316
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 65 transition count 316
Applied a total of 24 rules in 3 ms. Remains 65 /77 variables (removed 12) and now considering 316/328 (removed 12) transitions.
[2022-05-17 14:01:46] [INFO ] Flow matrix only has 80 transitions (discarded 236 similar events)
// Phase 1: matrix 80 rows 65 cols
[2022-05-17 14:01:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-17 14:01:46] [INFO ] Flow matrix only has 80 transitions (discarded 236 similar events)
// Phase 1: matrix 80 rows 65 cols
[2022-05-17 14:01:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:46] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/202 places, 316/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/202 places, 316/439 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s62 1), p0:(AND (GEQ s33 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-00 finished in 837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U F(p0))||F(p0)||G(p1))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 201 transition count 419
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 182 transition count 419
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 39 place count 182 transition count 406
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 65 place count 169 transition count 406
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 82 place count 152 transition count 389
Iterating global reduction 2 with 17 rules applied. Total rules applied 99 place count 152 transition count 389
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 105 place count 146 transition count 383
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 146 transition count 383
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 142 transition count 383
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 115 place count 142 transition count 379
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 123 place count 138 transition count 379
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 131 transition count 372
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 131 transition count 372
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 127 transition count 368
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 127 transition count 368
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 152 place count 120 transition count 361
Iterating global reduction 3 with 7 rules applied. Total rules applied 159 place count 120 transition count 361
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 201 place count 99 transition count 340
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 208 place count 92 transition count 333
Iterating global reduction 3 with 7 rules applied. Total rules applied 215 place count 92 transition count 333
Applied a total of 215 rules in 70 ms. Remains 92 /202 variables (removed 110) and now considering 333/439 (removed 106) transitions.
[2022-05-17 14:01:46] [INFO ] Flow matrix only has 131 transitions (discarded 202 similar events)
// Phase 1: matrix 131 rows 92 cols
[2022-05-17 14:01:46] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 14:01:46] [INFO ] Implicit Places using invariants in 74 ms returned [9, 15, 27, 33, 38, 52, 63, 70, 73, 76]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 78 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/202 places, 333/439 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 64 transition count 315
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 64 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 61 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 61 transition count 312
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 58 transition count 309
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 58 transition count 309
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 64 place count 50 transition count 301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 48 transition count 299
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 48 transition count 299
Applied a total of 68 rules in 20 ms. Remains 48 /82 variables (removed 34) and now considering 299/333 (removed 34) transitions.
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2022-05-17 14:01:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2022-05-17 14:01:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/202 places, 299/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/202 places, 299/439 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s30 1), p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-02 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&F(p2))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 180 transition count 417
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 180 transition count 417
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 165 transition count 402
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 165 transition count 402
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 160 transition count 402
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 95 place count 144 transition count 386
Iterating global reduction 1 with 16 rules applied. Total rules applied 111 place count 144 transition count 386
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 139 transition count 386
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 124 transition count 371
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 124 transition count 371
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 156 place count 114 transition count 361
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 114 transition count 361
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 104 transition count 351
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 104 transition count 351
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 205 place count 85 transition count 332
Iterating global reduction 2 with 19 rules applied. Total rules applied 224 place count 85 transition count 332
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 241 place count 68 transition count 315
Iterating global reduction 2 with 17 rules applied. Total rules applied 258 place count 68 transition count 315
Applied a total of 258 rules in 24 ms. Remains 68 /202 variables (removed 134) and now considering 315/439 (removed 124) transitions.
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 67 transitions (discarded 248 similar events)
// Phase 1: matrix 67 rows 68 cols
[2022-05-17 14:01:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants in 56 ms returned [17, 23, 35, 41, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 58 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/202 places, 315/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 54 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 54 transition count 306
Applied a total of 18 rules in 3 ms. Remains 54 /63 variables (removed 9) and now considering 306/315 (removed 9) transitions.
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 55 transitions (discarded 251 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-17 14:01:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 55 transitions (discarded 251 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-17 14:01:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/202 places, 306/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/202 places, 306/439 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, (NOT p2), (OR (NOT p2) p1), true, (OR (NOT p2) p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s41 1) (GEQ s44 1)), p1:(GEQ s23 1), p2:(OR (LT s21 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 952 steps with 341 reset in 13 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-03 finished in 402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||F(p1)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 181 transition count 418
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 181 transition count 418
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 166 transition count 403
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 166 transition count 403
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 162 transition count 403
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 91 place count 147 transition count 388
Iterating global reduction 1 with 15 rules applied. Total rules applied 106 place count 147 transition count 388
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 111 place count 142 transition count 388
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 125 place count 128 transition count 374
Iterating global reduction 2 with 14 rules applied. Total rules applied 139 place count 128 transition count 374
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 119 transition count 365
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 119 transition count 365
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 166 place count 110 transition count 356
Iterating global reduction 2 with 9 rules applied. Total rules applied 175 place count 110 transition count 356
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 190 place count 95 transition count 341
Iterating global reduction 2 with 15 rules applied. Total rules applied 205 place count 95 transition count 341
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 222 place count 78 transition count 324
Iterating global reduction 2 with 17 rules applied. Total rules applied 239 place count 78 transition count 324
Applied a total of 239 rules in 18 ms. Remains 78 /202 variables (removed 124) and now considering 324/439 (removed 115) transitions.
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 84 transitions (discarded 240 similar events)
// Phase 1: matrix 84 rows 78 cols
[2022-05-17 14:01:47] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants in 65 ms returned [17, 24, 34, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/202 places, 324/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 65 transition count 315
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 65 transition count 315
Applied a total of 18 rules in 2 ms. Remains 65 /74 variables (removed 9) and now considering 315/324 (removed 9) transitions.
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 73 transitions (discarded 242 similar events)
// Phase 1: matrix 73 rows 65 cols
[2022-05-17 14:01:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-17 14:01:47] [INFO ] Flow matrix only has 73 transitions (discarded 242 similar events)
// Phase 1: matrix 73 rows 65 cols
[2022-05-17 14:01:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:01:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/202 places, 315/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/202 places, 315/439 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s15 1) (GEQ s53 1)), p0:(OR (LT s32 1) (LT s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 413 steps with 12 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-04 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((X(p0) U (G(p2)&&p1))||G(p0))) U !p2)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 201 transition count 422
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 185 transition count 418
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 181 transition count 418
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 41 place count 181 transition count 405
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 67 place count 168 transition count 405
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 82 place count 153 transition count 390
Iterating global reduction 3 with 15 rules applied. Total rules applied 97 place count 153 transition count 390
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 148 transition count 385
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 148 transition count 385
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 145 transition count 385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 110 place count 145 transition count 382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 142 transition count 382
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 122 place count 136 transition count 376
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 136 transition count 376
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 133 transition count 373
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 133 transition count 373
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 140 place count 127 transition count 367
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 127 transition count 367
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 192 place count 104 transition count 344
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 200 place count 96 transition count 336
Iterating global reduction 4 with 8 rules applied. Total rules applied 208 place count 96 transition count 336
Applied a total of 208 rules in 50 ms. Remains 96 /202 variables (removed 106) and now considering 336/439 (removed 103) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 142 transitions (discarded 194 similar events)
// Phase 1: matrix 142 rows 96 cols
[2022-05-17 14:01:48] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 76 ms returned [21, 32, 38, 43, 51, 55, 66, 73, 76, 79]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 79 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/202 places, 336/439 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 321
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 321
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 67 transition count 317
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 67 transition count 317
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 60 transition count 310
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 60 transition count 310
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 66 place count 53 transition count 303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 51 transition count 301
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 51 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 50 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 50 transition count 300
Applied a total of 72 rules in 15 ms. Remains 50 /86 variables (removed 36) and now considering 300/336 (removed 36) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
// Phase 1: matrix 55 rows 50 cols
[2022-05-17 14:01:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
// Phase 1: matrix 55 rows 50 cols
[2022-05-17 14:01:48] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/202 places, 300/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/202 places, 300/439 transitions.
Stuttering acceptance computed with spot in 225 ms :[p2, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), p2, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s7 1)), p1:(AND (GEQ s4 1) (GEQ s7 1)), p0:(AND (GEQ s9 1) (GEQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 72 steps with 4 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-07 finished in 511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(F(p0))||(!p1&&F(p0)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 201 transition count 419
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 182 transition count 419
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 39 place count 182 transition count 406
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 65 place count 169 transition count 406
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 81 place count 153 transition count 390
Iterating global reduction 2 with 16 rules applied. Total rules applied 97 place count 153 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 148 transition count 385
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 148 transition count 385
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 145 transition count 385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 110 place count 145 transition count 382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 142 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 136 transition count 376
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 136 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 133 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 133 transition count 373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 127 transition count 367
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 127 transition count 367
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 192 place count 104 transition count 344
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 199 place count 97 transition count 337
Iterating global reduction 3 with 7 rules applied. Total rules applied 206 place count 97 transition count 337
Applied a total of 206 rules in 43 ms. Remains 97 /202 variables (removed 105) and now considering 337/439 (removed 102) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 142 transitions (discarded 195 similar events)
// Phase 1: matrix 142 rows 97 cols
[2022-05-17 14:01:48] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 68 ms returned [9, 15, 25, 37, 42, 50, 67, 74, 77, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 69 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/202 places, 337/439 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 68 transition count 318
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 68 transition count 318
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 65 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 65 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 62 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 62 transition count 312
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 66 place count 54 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 52 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 52 transition count 302
Applied a total of 70 rules in 14 ms. Remains 52 /87 variables (removed 35) and now considering 302/337 (removed 35) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 14:01:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 64 transitions (discarded 238 similar events)
// Phase 1: matrix 64 rows 52 cols
[2022-05-17 14:01:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/202 places, 302/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 52/202 places, 302/439 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s20 1) (GEQ s22 1)), p0:(GEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-08 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p1 U p2))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 201 transition count 423
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 186 transition count 419
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 182 transition count 419
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 39 place count 182 transition count 406
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 65 place count 169 transition count 406
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 80 place count 154 transition count 391
Iterating global reduction 3 with 15 rules applied. Total rules applied 95 place count 154 transition count 391
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 148 transition count 385
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 148 transition count 385
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 144 transition count 385
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 111 place count 144 transition count 381
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 119 place count 140 transition count 381
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 126 place count 133 transition count 374
Iterating global reduction 4 with 7 rules applied. Total rules applied 133 place count 133 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 137 place count 129 transition count 370
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 129 transition count 370
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 149 place count 121 transition count 362
Iterating global reduction 4 with 8 rules applied. Total rules applied 157 place count 121 transition count 362
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 199 place count 100 transition count 341
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 206 place count 93 transition count 334
Iterating global reduction 4 with 7 rules applied. Total rules applied 213 place count 93 transition count 334
Applied a total of 213 rules in 39 ms. Remains 93 /202 variables (removed 109) and now considering 334/439 (removed 105) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 133 transitions (discarded 201 similar events)
// Phase 1: matrix 133 rows 93 cols
[2022-05-17 14:01:48] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 76 ms returned [15, 25, 32, 45, 49, 62, 69, 72]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/202 places, 334/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 323
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 323
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 71 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 71 transition count 320
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 67 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 67 transition count 316
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 50 place count 60 transition count 309
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 58 transition count 307
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 58 transition count 307
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 56 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 56 transition count 305
Applied a total of 58 rules in 13 ms. Remains 56 /85 variables (removed 29) and now considering 305/334 (removed 29) transitions.
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 62 transitions (discarded 243 similar events)
// Phase 1: matrix 62 rows 56 cols
[2022-05-17 14:01:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:48] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 14:01:48] [INFO ] Flow matrix only has 62 transitions (discarded 243 similar events)
// Phase 1: matrix 62 rows 56 cols
[2022-05-17 14:01:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:01:49] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/202 places, 305/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/202 places, 305/439 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s21 1)), p0:(OR (AND (GEQ s47 1) (GEQ s36 1) (GEQ s25 1) (GEQ s32 1)) (GEQ s47 1)), p1:(GEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-09 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 201 transition count 419
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 182 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 181 transition count 418
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 41 place count 181 transition count 405
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 67 place count 168 transition count 405
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 83 place count 152 transition count 389
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 152 transition count 389
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 146 transition count 383
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 146 transition count 383
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 115 place count 142 transition count 383
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 115 place count 142 transition count 379
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 123 place count 138 transition count 379
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 130 place count 131 transition count 372
Iterating global reduction 4 with 7 rules applied. Total rules applied 137 place count 131 transition count 372
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 127 transition count 368
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 127 transition count 368
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 153 place count 119 transition count 360
Iterating global reduction 4 with 8 rules applied. Total rules applied 161 place count 119 transition count 360
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 203 place count 98 transition count 339
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 210 place count 91 transition count 332
Iterating global reduction 4 with 7 rules applied. Total rules applied 217 place count 91 transition count 332
Applied a total of 217 rules in 39 ms. Remains 91 /202 variables (removed 111) and now considering 332/439 (removed 107) transitions.
[2022-05-17 14:01:49] [INFO ] Flow matrix only has 130 transitions (discarded 202 similar events)
// Phase 1: matrix 130 rows 91 cols
[2022-05-17 14:01:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 14:01:49] [INFO ] Implicit Places using invariants in 67 ms returned [9, 15, 31, 36, 45, 49, 69, 72, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 68 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/202 places, 332/439 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 320
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 320
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 67 transition count 317
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 67 transition count 317
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 62 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 62 transition count 312
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 54 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 52 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 52 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 51 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 51 transition count 301
Applied a total of 62 rules in 17 ms. Remains 51 /82 variables (removed 31) and now considering 301/332 (removed 31) transitions.
[2022-05-17 14:01:49] [INFO ] Flow matrix only has 57 transitions (discarded 244 similar events)
// Phase 1: matrix 57 rows 51 cols
[2022-05-17 14:01:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-17 14:01:49] [INFO ] Flow matrix only has 57 transitions (discarded 244 similar events)
// Phase 1: matrix 57 rows 51 cols
[2022-05-17 14:01:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/202 places, 301/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/202 places, 301/439 transitions.
Stuttering acceptance computed with spot in 610 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-10 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s20 1)), p1:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-10 finished in 867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(F(G(X(p0))))||X(G(p1)))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Graph (complete) has 833 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 201 transition count 418
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 181 transition count 418
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 41 place count 181 transition count 405
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 67 place count 168 transition count 405
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 84 place count 151 transition count 388
Iterating global reduction 2 with 17 rules applied. Total rules applied 101 place count 151 transition count 388
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 145 transition count 382
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 145 transition count 382
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 141 transition count 382
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 117 place count 141 transition count 378
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 125 place count 137 transition count 378
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 130 transition count 371
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 130 transition count 371
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 126 transition count 367
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 126 transition count 367
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 118 transition count 359
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 118 transition count 359
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 205 place count 97 transition count 338
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 213 place count 89 transition count 330
Iterating global reduction 3 with 8 rules applied. Total rules applied 221 place count 89 transition count 330
Applied a total of 221 rules in 29 ms. Remains 89 /202 variables (removed 113) and now considering 330/439 (removed 109) transitions.
[2022-05-17 14:01:50] [INFO ] Flow matrix only has 127 transitions (discarded 203 similar events)
// Phase 1: matrix 127 rows 89 cols
[2022-05-17 14:01:50] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 14:01:50] [INFO ] Implicit Places using invariants in 70 ms returned [9, 15, 25, 32, 37, 45, 49, 60, 67, 70, 73]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 78 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/202 places, 330/439 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 311
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 311
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 55 transition count 307
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 55 transition count 307
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 51 transition count 303
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 51 transition count 303
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 45 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 43 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 43 transition count 295
Applied a total of 70 rules in 8 ms. Remains 43 /78 variables (removed 35) and now considering 295/330 (removed 35) transitions.
[2022-05-17 14:01:50] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-17 14:01:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:01:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-17 14:01:50] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-17 14:01:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 14:01:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/202 places, 295/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 43/202 places, 295/439 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s30 1)), p1:(LT s21 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7289 reset in 277 ms.
Product exploration explored 100000 steps with 7287 reset in 256 ms.
Computed a total of 43 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 295
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 : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-11 finished in 1164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(!p0)||p1) U (X(p2)||p0)))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 182 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 182 transition count 419
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 169 transition count 406
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 169 transition count 406
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 166 transition count 406
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 155 transition count 395
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 155 transition count 395
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 150 transition count 395
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 109 place count 137 transition count 382
Iterating global reduction 2 with 13 rules applied. Total rules applied 122 place count 137 transition count 382
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 129 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 129 transition count 374
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 146 place count 121 transition count 366
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 121 transition count 366
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 167 place count 108 transition count 353
Iterating global reduction 2 with 13 rules applied. Total rules applied 180 place count 108 transition count 353
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 197 place count 91 transition count 336
Iterating global reduction 2 with 17 rules applied. Total rules applied 214 place count 91 transition count 336
Applied a total of 214 rules in 18 ms. Remains 91 /202 variables (removed 111) and now considering 336/439 (removed 103) transitions.
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 103 transitions (discarded 233 similar events)
// Phase 1: matrix 103 rows 91 cols
[2022-05-17 14:01:51] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants in 63 ms returned [24, 35, 45, 51, 78]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 64 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/202 places, 336/439 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 323
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 323
Applied a total of 26 rules in 2 ms. Remains 73 /86 variables (removed 13) and now considering 323/336 (removed 13) transitions.
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 87 transitions (discarded 236 similar events)
// Phase 1: matrix 87 rows 73 cols
[2022-05-17 14:01:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 87 transitions (discarded 236 similar events)
// Phase 1: matrix 87 rows 73 cols
[2022-05-17 14:01:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/202 places, 323/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/202 places, 323/439 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR p2 p0), p2, (OR p2 p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s18 1)), p1:(AND (GEQ s58 1) (GEQ s60 1)), p2:(AND (GEQ s14 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-13 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2))&&X(p3)))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 439/439 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 182 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 182 transition count 419
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 168 transition count 405
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 168 transition count 405
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 163 transition count 405
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 88 place count 148 transition count 390
Iterating global reduction 1 with 15 rules applied. Total rules applied 103 place count 148 transition count 390
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 107 place count 144 transition count 390
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 131 transition count 377
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 131 transition count 377
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 142 place count 122 transition count 368
Iterating global reduction 2 with 9 rules applied. Total rules applied 151 place count 122 transition count 368
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 113 transition count 359
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 113 transition count 359
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 187 place count 95 transition count 341
Iterating global reduction 2 with 18 rules applied. Total rules applied 205 place count 95 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 220 place count 80 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 235 place count 80 transition count 326
Applied a total of 235 rules in 15 ms. Remains 80 /202 variables (removed 122) and now considering 326/439 (removed 113) transitions.
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 87 transitions (discarded 239 similar events)
// Phase 1: matrix 87 rows 80 cols
[2022-05-17 14:01:51] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants in 57 ms returned [17, 24, 36, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/202 places, 326/439 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 319
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 319
Applied a total of 14 rules in 1 ms. Remains 69 /76 variables (removed 7) and now considering 319/326 (removed 7) transitions.
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 77 transitions (discarded 242 similar events)
// Phase 1: matrix 77 rows 69 cols
[2022-05-17 14:01:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-17 14:01:51] [INFO ] Flow matrix only has 77 transitions (discarded 242 similar events)
// Phase 1: matrix 77 rows 69 cols
[2022-05-17 14:01:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:01:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/202 places, 319/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 69/202 places, 319/439 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s33 1)), p0:(LT s55 1), p2:(LT s23 1), p3:(AND (GEQ s19 1) (GEQ s44 1) (GEQ s55 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C4-LTLFireability-14 finished in 463 ms.
All properties solved by simple procedures.
Total runtime 9188 ms.

BK_STOP 1652796112499

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S16C4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C4, 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 r132-tall-165271821000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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