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.r276-smll-165307352800004.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 UtahNoC-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Apr 30 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-LTLFireability-00
FORMULA_NAME UtahNoC-PT-none-LTLFireability-01
FORMULA_NAME UtahNoC-PT-none-LTLFireability-02
FORMULA_NAME UtahNoC-PT-none-LTLFireability-03
FORMULA_NAME UtahNoC-PT-none-LTLFireability-04
FORMULA_NAME UtahNoC-PT-none-LTLFireability-05
FORMULA_NAME UtahNoC-PT-none-LTLFireability-06
FORMULA_NAME UtahNoC-PT-none-LTLFireability-07
FORMULA_NAME UtahNoC-PT-none-LTLFireability-08
FORMULA_NAME UtahNoC-PT-none-LTLFireability-09
FORMULA_NAME UtahNoC-PT-none-LTLFireability-10
FORMULA_NAME UtahNoC-PT-none-LTLFireability-11
FORMULA_NAME UtahNoC-PT-none-LTLFireability-12
FORMULA_NAME UtahNoC-PT-none-LTLFireability-13
FORMULA_NAME UtahNoC-PT-none-LTLFireability-14
FORMULA_NAME UtahNoC-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653115896344

Running Version 202205111006
[2022-05-21 06:51:38] [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-21 06:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:51:38] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-05-21 06:51:38] [INFO ] Transformed 216 places.
[2022-05-21 06:51:38] [INFO ] Transformed 977 transitions.
[2022-05-21 06:51:38] [INFO ] Found NUPN structural information;
[2022-05-21 06:51:38] [INFO ] Parsed PT model containing 216 places and 977 transitions in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA UtahNoC-PT-none-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 177 transition count 677
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 177 transition count 677
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 106 place count 177 transition count 649
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 174 transition count 640
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 174 transition count 640
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 174 transition count 636
Applied a total of 116 rules in 79 ms. Remains 174 /216 variables (removed 42) and now considering 636/829 (removed 193) transitions.
[2022-05-21 06:51:39] [INFO ] Flow matrix only has 338 transitions (discarded 298 similar events)
// Phase 1: matrix 338 rows 174 cols
[2022-05-21 06:51:39] [INFO ] Computed 8 place invariants in 22 ms
[2022-05-21 06:51:39] [INFO ] Implicit Places using invariants in 320 ms returned []
[2022-05-21 06:51:39] [INFO ] Flow matrix only has 338 transitions (discarded 298 similar events)
// Phase 1: matrix 338 rows 174 cols
[2022-05-21 06:51:39] [INFO ] Computed 8 place invariants in 4 ms
[2022-05-21 06:51:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-21 06:51:39] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2022-05-21 06:51:39] [INFO ] Flow matrix only has 338 transitions (discarded 298 similar events)
// Phase 1: matrix 338 rows 174 cols
[2022-05-21 06:51:39] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-21 06:51:40] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/216 places, 636/829 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/216 places, 636/829 transitions.
Support contains 45 out of 174 places after structural reductions.
[2022-05-21 06:51:40] [INFO ] Flatten gal took : 119 ms
[2022-05-21 06:51:40] [INFO ] Flatten gal took : 58 ms
[2022-05-21 06:51:40] [INFO ] Input system was already deterministic with 636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=10 ) properties (out of 35) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-21 06:51:42] [INFO ] Flow matrix only has 338 transitions (discarded 298 similar events)
// Phase 1: matrix 338 rows 174 cols
[2022-05-21 06:51:42] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-21 06:51:42] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-21 06:51:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-21 06:51:43] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-21 06:51:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-21 06:51:43] [INFO ] After 174ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-21 06:51:43] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-05-21 06:51:43] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 70 ms.
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 174/174 places, 636/636 transitions.
Graph (trivial) has 246 edges and 174 vertex of which 59 / 174 are part of one of the 14 SCC in 20 ms
Free SCC test removed 45 places
Drop transitions removed 169 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 129 transition count 409
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 125 transition count 407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 123 transition count 407
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 123 transition count 405
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 121 transition count 405
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 30 place count 108 transition count 360
Iterating global reduction 3 with 13 rules applied. Total rules applied 43 place count 108 transition count 360
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 54 place count 108 transition count 349
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 107 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 107 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 107 transition count 345
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 63 place count 104 transition count 340
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 80 place count 104 transition count 323
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 83 place count 102 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 84 place count 101 transition count 322
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 85 place count 100 transition count 320
Iterating global reduction 8 with 1 rules applied. Total rules applied 86 place count 100 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 87 place count 100 transition count 319
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 99 place count 94 transition count 344
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 103 place count 94 transition count 340
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 124 place count 94 transition count 319
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 127 place count 91 transition count 316
Iterating global reduction 10 with 3 rules applied. Total rules applied 130 place count 91 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 132 place count 91 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 134 place count 90 transition count 327
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 136 place count 90 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 139 place count 88 transition count 324
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 140 place count 88 transition count 323
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 143 place count 88 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 87 transition count 322
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 68 edges and 85 vertex of which 17 / 85 are part of one of the 4 SCC in 1 ms
Free SCC test removed 13 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 147 place count 72 transition count 322
Drop transitions removed 24 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 13 with 48 rules applied. Total rules applied 195 place count 72 transition count 274
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 198 place count 69 transition count 262
Iterating global reduction 14 with 3 rules applied. Total rules applied 201 place count 69 transition count 262
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 207 place count 66 transition count 278
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 209 place count 66 transition count 276
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 214 place count 66 transition count 271
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 216 place count 66 transition count 269
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 221 place count 64 transition count 266
Applied a total of 221 rules in 255 ms. Remains 64 /174 variables (removed 110) and now considering 266/636 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/174 places, 266/636 transitions.
Finished random walk after 1486 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=123 )
Computed a total of 2 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(G(p1))&&F(p2)))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 157 transition count 559
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 157 transition count 559
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 157 transition count 543
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 153 transition count 531
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 153 transition count 531
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 153 transition count 525
Applied a total of 64 rules in 12 ms. Remains 153 /174 variables (removed 21) and now considering 525/636 (removed 111) transitions.
[2022-05-21 06:51:44] [INFO ] Flow matrix only has 275 transitions (discarded 250 similar events)
// Phase 1: matrix 275 rows 153 cols
[2022-05-21 06:51:44] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:44] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 525/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 500
Applied a total of 10 rules in 6 ms. Remains 147 /152 variables (removed 5) and now considering 500/525 (removed 25) transitions.
[2022-05-21 06:51:44] [INFO ] Flow matrix only has 270 transitions (discarded 230 similar events)
// Phase 1: matrix 270 rows 147 cols
[2022-05-21 06:51:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-21 06:51:44] [INFO ] Flow matrix only has 270 transitions (discarded 230 similar events)
// Phase 1: matrix 270 rows 147 cols
[2022-05-21 06:51:44] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:51:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:51:44] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/174 places, 500/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/174 places, 500/636 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s11 0) (EQ s106 0)), p0:(AND (EQ s11 1) (EQ s106 1)), p1:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 12 ms.
FORMULA UtahNoC-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-00 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(G((F(X(p0))||p1)))))||F(p2)))'
Support contains 6 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Graph (trivial) has 258 edges and 174 vertex of which 64 / 174 are part of one of the 14 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 171 edges and 122 vertex of which 24 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 482
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 79 place count 102 transition count 406
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 96 place count 85 transition count 335
Iterating global reduction 2 with 17 rules applied. Total rules applied 113 place count 85 transition count 335
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 128 place count 85 transition count 320
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 81 transition count 309
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 81 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 81 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 79 transition count 302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 149 place count 79 transition count 298
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 151 place count 77 transition count 292
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 77 transition count 292
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 76 transition count 290
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 76 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 76 transition count 289
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 182 place count 76 transition count 263
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 76 transition count 263
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 74 transition count 261
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 74 transition count 261
Applied a total of 188 rules in 60 ms. Remains 74 /174 variables (removed 100) and now considering 261/636 (removed 375) transitions.
[2022-05-21 06:51:45] [INFO ] Flow matrix only has 125 transitions (discarded 136 similar events)
// Phase 1: matrix 125 rows 74 cols
[2022-05-21 06:51:45] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-21 06:51:45] [INFO ] Flow matrix only has 125 transitions (discarded 136 similar events)
// Phase 1: matrix 125 rows 74 cols
[2022-05-21 06:51:45] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-21 06:51:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-21 06:51:45] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-21 06:51:45] [INFO ] Flow matrix only has 125 transitions (discarded 136 similar events)
// Phase 1: matrix 125 rows 74 cols
[2022-05-21 06:51:45] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:45] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/174 places, 261/636 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/174 places, 261/636 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s72 1)), p1:(AND (EQ s24 1) (EQ s68 1)), p0:(AND (EQ s22 1) (EQ s58 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 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-01 finished in 604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(X(p1))||(G(p2)&&(G(p3) U p1)))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 564
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 158 transition count 564
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 158 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 156 transition count 546
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 156 transition count 546
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 156 transition count 543
Applied a total of 51 rules in 21 ms. Remains 156 /174 variables (removed 18) and now considering 543/636 (removed 93) transitions.
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 289 transitions (discarded 254 similar events)
// Phase 1: matrix 289 rows 156 cols
[2022-05-21 06:51:46] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:46] [INFO ] Implicit Places using invariants in 93 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/174 places, 543/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 150 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 150 transition count 518
Applied a total of 10 rules in 11 ms. Remains 150 /155 variables (removed 5) and now considering 518/543 (removed 25) transitions.
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 284 transitions (discarded 234 similar events)
// Phase 1: matrix 284 rows 150 cols
[2022-05-21 06:51:46] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 284 transitions (discarded 234 similar events)
// Phase 1: matrix 284 rows 150 cols
[2022-05-21 06:51:46] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:51:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:51:46] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/174 places, 518/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 150/174 places, 518/636 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s21 1), p1:(AND (EQ s64 1) (EQ s127 1)), p0:(OR (EQ s1 0) (EQ s139 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-03 finished in 667 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U F(X(X((!X(p1)&&F(!F(p2))))))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 157 transition count 559
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 157 transition count 559
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 157 transition count 543
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 153 transition count 531
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 153 transition count 531
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 153 transition count 525
Applied a total of 64 rules in 14 ms. Remains 153 /174 variables (removed 21) and now considering 525/636 (removed 111) transitions.
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 275 transitions (discarded 250 similar events)
// Phase 1: matrix 275 rows 153 cols
[2022-05-21 06:51:46] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:46] [INFO ] Implicit Places using invariants in 80 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 525/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 500
Applied a total of 10 rules in 8 ms. Remains 147 /152 variables (removed 5) and now considering 500/525 (removed 25) transitions.
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 270 transitions (discarded 230 similar events)
// Phase 1: matrix 270 rows 147 cols
[2022-05-21 06:51:46] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-21 06:51:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-21 06:51:46] [INFO ] Flow matrix only has 270 transitions (discarded 230 similar events)
// Phase 1: matrix 270 rows 147 cols
[2022-05-21 06:51:46] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:51:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:51:47] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/174 places, 500/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/174 places, 500/636 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p1]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s71 1) (EQ s106 1)), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 444 steps with 0 reset in 8 ms.
FORMULA UtahNoC-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-04 finished in 803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(X(p1))))'
Support contains 6 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 157 transition count 556
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 157 transition count 556
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 157 transition count 540
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 153 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 153 transition count 528
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 153 transition count 522
Applied a total of 64 rules in 9 ms. Remains 153 /174 variables (removed 21) and now considering 522/636 (removed 114) transitions.
[2022-05-21 06:51:47] [INFO ] Flow matrix only has 280 transitions (discarded 242 similar events)
// Phase 1: matrix 280 rows 153 cols
[2022-05-21 06:51:47] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:47] [INFO ] Implicit Places using invariants in 96 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 522/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 497
Applied a total of 10 rules in 28 ms. Remains 147 /152 variables (removed 5) and now considering 497/522 (removed 25) transitions.
[2022-05-21 06:51:47] [INFO ] Flow matrix only has 275 transitions (discarded 222 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:51:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-21 06:51:47] [INFO ] Flow matrix only has 275 transitions (discarded 222 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:51:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:51:47] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/174 places, 497/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/174 places, 497/636 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (EQ s29 0) (EQ s93 0) (EQ s142 0)) (OR (EQ s85 0) (EQ s116 0))), p1:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-05 finished in 635 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||(F(p2) U (F(p0) U p2)))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Graph (trivial) has 271 edges and 174 vertex of which 71 / 174 are part of one of the 15 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 173 edges and 116 vertex of which 24 / 116 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 465
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 79 place count 96 transition count 389
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 96 place count 79 transition count 318
Iterating global reduction 2 with 17 rules applied. Total rules applied 113 place count 79 transition count 318
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 129 place count 79 transition count 302
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 75 transition count 292
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 75 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 143 place count 75 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 72 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 72 transition count 279
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 155 place count 70 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 70 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 159 place count 70 transition count 271
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 175 place count 70 transition count 255
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 70 transition count 255
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 177 place count 69 transition count 254
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 69 transition count 254
Applied a total of 178 rules in 41 ms. Remains 69 /174 variables (removed 105) and now considering 254/636 (removed 382) transitions.
[2022-05-21 06:51:48] [INFO ] Flow matrix only has 120 transitions (discarded 134 similar events)
// Phase 1: matrix 120 rows 69 cols
[2022-05-21 06:51:48] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-21 06:51:48] [INFO ] Flow matrix only has 120 transitions (discarded 134 similar events)
// Phase 1: matrix 120 rows 69 cols
[2022-05-21 06:51:48] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-21 06:51:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-21 06:51:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-21 06:51:48] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-21 06:51:48] [INFO ] Flow matrix only has 120 transitions (discarded 134 similar events)
// Phase 1: matrix 120 rows 69 cols
[2022-05-21 06:51:48] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:48] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/174 places, 254/636 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/174 places, 254/636 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s55 1)), p0:(AND (EQ s21 1) (EQ s55 1)), p2:(AND (EQ s0 1) (EQ s59 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 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-06 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!p0) U !p1))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 157 transition count 556
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 157 transition count 556
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 157 transition count 540
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 153 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 153 transition count 528
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 153 transition count 522
Applied a total of 64 rules in 15 ms. Remains 153 /174 variables (removed 21) and now considering 522/636 (removed 114) transitions.
[2022-05-21 06:51:48] [INFO ] Flow matrix only has 280 transitions (discarded 242 similar events)
// Phase 1: matrix 280 rows 153 cols
[2022-05-21 06:51:48] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 06:51:48] [INFO ] Implicit Places using invariants in 200 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 522/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 497
Applied a total of 10 rules in 6 ms. Remains 147 /152 variables (removed 5) and now considering 497/522 (removed 25) transitions.
[2022-05-21 06:51:48] [INFO ] Flow matrix only has 275 transitions (discarded 222 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:51:48] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:51:49] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-21 06:51:49] [INFO ] Flow matrix only has 275 transitions (discarded 222 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:51:49] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:51:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/174 places, 497/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/174 places, 497/636 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s50 1) (AND (EQ s76 1) (EQ s115 1))), p0:(AND (EQ s22 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2109 steps with 0 reset in 20 ms.
FORMULA UtahNoC-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-07 finished in 721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Graph (trivial) has 283 edges and 174 vertex of which 74 / 174 are part of one of the 13 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 173 edges and 111 vertex of which 24 / 111 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 453
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 79 place count 91 transition count 377
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 94 place count 76 transition count 308
Iterating global reduction 2 with 15 rules applied. Total rules applied 109 place count 76 transition count 308
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 126 place count 76 transition count 291
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 72 transition count 280
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 72 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 72 transition count 274
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 69 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 150 place count 69 transition count 267
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 67 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 67 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 156 place count 67 transition count 259
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 177 place count 67 transition count 238
Applied a total of 177 rules in 48 ms. Remains 67 /174 variables (removed 107) and now considering 238/636 (removed 398) transitions.
[2022-05-21 06:51:49] [INFO ] Flow matrix only has 114 transitions (discarded 124 similar events)
// Phase 1: matrix 114 rows 67 cols
[2022-05-21 06:51:49] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-21 06:51:49] [INFO ] Flow matrix only has 114 transitions (discarded 124 similar events)
// Phase 1: matrix 114 rows 67 cols
[2022-05-21 06:51:49] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-21 06:51:49] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2022-05-21 06:51:49] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-21 06:51:49] [INFO ] Flow matrix only has 114 transitions (discarded 124 similar events)
// Phase 1: matrix 114 rows 67 cols
[2022-05-21 06:51:49] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:49] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/174 places, 238/636 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/174 places, 238/636 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-09 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)&&F(X(p2))&&p3)))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 156 transition count 552
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 156 transition count 552
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 156 transition count 536
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 152 transition count 524
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 152 transition count 524
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 152 transition count 518
Applied a total of 66 rules in 38 ms. Remains 152 /174 variables (removed 22) and now considering 518/636 (removed 118) transitions.
[2022-05-21 06:51:49] [INFO ] Flow matrix only has 276 transitions (discarded 242 similar events)
// Phase 1: matrix 276 rows 152 cols
[2022-05-21 06:51:49] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants in 104 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/174 places, 518/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 493
Applied a total of 10 rules in 4 ms. Remains 146 /151 variables (removed 5) and now considering 493/518 (removed 25) transitions.
[2022-05-21 06:51:50] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
// Phase 1: matrix 271 rows 146 cols
[2022-05-21 06:51:50] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-05-21 06:51:50] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
// Phase 1: matrix 271 rows 146 cols
[2022-05-21 06:51:50] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/174 places, 493/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 146/174 places, 493/636 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (AND (NOT p1) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s97 1), p1:(AND (EQ s76 1) (EQ s114 1)), p0:(AND (EQ s57 1) (EQ s124 1)), p2:(EQ s97 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-10 finished in 822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((X(!G(p0)) U p1) U X((X(p3)&&p2))))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 157 transition count 559
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 157 transition count 559
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 47 place count 157 transition count 546
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 155 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 155 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 155 transition count 537
Applied a total of 54 rules in 7 ms. Remains 155 /174 variables (removed 19) and now considering 537/636 (removed 99) transitions.
[2022-05-21 06:51:50] [INFO ] Flow matrix only has 287 transitions (discarded 250 similar events)
// Phase 1: matrix 287 rows 155 cols
[2022-05-21 06:51:50] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants in 64 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 537/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 512
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 512
Applied a total of 10 rules in 9 ms. Remains 149 /154 variables (removed 5) and now considering 512/537 (removed 25) transitions.
[2022-05-21 06:51:50] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:51:50] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-21 06:51:50] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:51:50] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:51:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:51:50] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/174 places, 512/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 149/174 places, 512/636 transitions.
Stuttering acceptance computed with spot in 697 ms :[(AND p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND p1 (NOT p0) p2 p3), (AND p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={1, 2} source=1 dest: 1}, { cond=(NOT p1), acceptance={1, 2} source=1 dest: 2}, { cond=true, acceptance={0, 1, 2} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={0, 2} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={2} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={1, 2} source=3 dest: 7}, { cond=p2, acceptance={0, 1, 2} source=3 dest: 8}, { cond=(AND p1 p2), acceptance={1, 2} source=3 dest: 9}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=4 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={1, 2} source=4 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=4 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 2} source=4 dest: 11}, { cond=(AND p1 p0 p2), acceptance={2} source=4 dest: 12}], [{ cond=(AND (NOT p1) p0 p2), acceptance={2} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1, 2} source=5 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=5 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={1, 2} source=5 dest: 9}, { cond=(AND p0 p2), acceptance={0, 2} source=5 dest: 11}, { cond=(AND p1 p0 p2), acceptance={2} source=5 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={2} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=6 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=6 dest: 3}, { cond=p0, acceptance={0, 2} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={2} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0) p3), acceptance={1, 2} source=7 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={1} source=7 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p1 p0 p3), acceptance={0, 2} source=7 dest: 5}, { cond=(AND p1 p0 p3), acceptance={2} source=7 dest: 6}], [{ cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=8 dest: 7}, { cond=(AND p2 p3), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(AND p1 p2 p3), acceptance={1, 2} source=8 dest: 9}], [{ cond=(AND p1 p3), acceptance={1, 2} source=9 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={1, 2} source=9 dest: 2}, { cond=p3, acceptance={0, 1, 2} source=9 dest: 3}], [{ cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={1} source=10 dest: 7}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={0, 1, 2} source=10 dest: 8}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={1, 2} source=10 dest: 9}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0, 1} source=10 dest: 10}, { cond=(AND p1 p0 p2 p3), acceptance={0, 2} source=10 dest: 11}, { cond=(AND p1 p0 p2 p3), acceptance={2} source=10 dest: 12}], [{ cond=(AND (NOT p1) p0 p2 p3), acceptance={2} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={1, 2} source=11 dest: 7}, { cond=(AND (NOT p0) p2 p3), acceptance={0, 1, 2} source=11 dest: 8}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={1, 2} source=11 dest: 9}, { cond=(AND p0 p2 p3), acceptance={0, 2} source=11 dest: 11}, { cond=(AND p1 p0 p2 p3), acceptance={2} source=11 dest: 12}], [{ cond=(AND p1 (NOT p0) p3), acceptance={1, 2} source=12 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={2} source=12 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={1, 2} source=12 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0, 1, 2} source=12 dest: 3}, { cond=(AND p0 p3), acceptance={0, 2} source=12 dest: 5}, { cond=(AND p1 p0 p3), acceptance={2} source=12 dest: 6}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s146 1)), p0:(EQ s18 1), p2:(AND (EQ s28 1) (EQ s146 1)), p3:(EQ s22 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25019 reset in 520 ms.
Product exploration explored 100000 steps with 25012 reset in 541 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 3101 ms. Reduced automaton from 13 states, 69 edges and 4 AP to 13 states, 69 edges and 4 AP.
Stuttering acceptance computed with spot in 682 ms :[(AND p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND p1 (NOT p0) p2 p3), (AND p2 p3), (AND p2 p3), (AND p1 (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 33) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2022-05-21 06:51:57] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:51:57] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:51:57] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-21 06:51:57] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0 real:10
[2022-05-21 06:51:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-21 06:51:58] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :4
[2022-05-21 06:51:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:51:58] [INFO ] After 87ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :20 sat :4
[2022-05-21 06:51:58] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :20 sat :4
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-21 06:51:58] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :4
Fused 24 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 512/512 transitions.
Graph (trivial) has 244 edges and 149 vertex of which 87 / 149 are part of one of the 16 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 196 transitions
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 253 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 77 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 77 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 77 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 76 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 76 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 76 transition count 249
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 73 transition count 244
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 30 place count 73 transition count 228
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 71 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 70 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 35 place count 69 transition count 225
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 69 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 69 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 49 place count 63 transition count 248
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 55 place count 63 transition count 242
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 83 place count 63 transition count 214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 62 transition count 213
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 62 transition count 213
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 88 place count 62 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 61 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 90 place count 60 transition count 212
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 98 place count 56 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 99 place count 56 transition count 227
Applied a total of 99 rules in 53 ms. Remains 56 /149 variables (removed 93) and now considering 227/512 (removed 285) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/149 places, 227/512 transitions.
Finished random walk after 1140 steps, including 0 resets, run visited all 4 properties in 55 ms. (steps per millisecond=20 )
Found 20 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p2 (NOT p1) p3))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p2 (NOT p1) p3))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND p0 p2 p1 p3))), (G (NOT (AND (NOT p0) p2 p1 p3))), (G (NOT (AND p1 p3))), (G (NOT (AND p2 p1 p3))), (G (NOT (AND p2 p3))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p0) p1 p3))), (G (NOT (AND p0 p2))), (G (NOT (AND p2 (NOT p1) p3))), (G (NOT (AND p0 p1 p3))), (G (NOT (AND p0 (NOT p1) p3))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 p3))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p0 p2 p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p3), (F p2), (F (AND (NOT p1) p3)), (F (AND p2 (NOT p1))), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2 (NOT p1))), (F p0), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p0) p3))]
Knowledge based reduction with 31 factoid took 29118 ms. Reduced automaton from 13 states, 69 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 386 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Stuttering acceptance computed with spot in 343 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-21 06:52:28] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:28] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:52:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-21 06:52:28] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:52:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:52:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2022-05-21 06:52:28] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:28] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-21 06:52:29] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/149 places, 512/512 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (OR p3 (NOT p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p3 (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 1874 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 402 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-21 06:52:31] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:31] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:52:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-21 06:52:31] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-21 06:52:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-21 06:52:32] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-21 06:52:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:52:32] [INFO ] After 34ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-21 06:52:32] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-21 06:52:32] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 512/512 transitions.
Graph (trivial) has 249 edges and 149 vertex of which 88 / 149 are part of one of the 15 SCC in 1 ms
Free SCC test removed 73 places
Drop transitions removed 199 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 262 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 75 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 75 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 74 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 74 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 74 transition count 240
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 71 transition count 235
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 30 place count 71 transition count 219
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 69 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 68 transition count 218
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 35 place count 67 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 67 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 67 transition count 215
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 49 place count 61 transition count 239
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 55 place count 61 transition count 233
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 83 place count 61 transition count 205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 60 transition count 204
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 60 transition count 204
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 88 place count 60 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 59 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 90 place count 58 transition count 203
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 98 place count 54 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 99 place count 54 transition count 218
Applied a total of 99 rules in 58 ms. Remains 54 /149 variables (removed 95) and now considering 218/512 (removed 294) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/149 places, 218/512 transitions.
Finished random walk after 341 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=170 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (OR p3 (NOT p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p3 (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (G (OR (AND (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p3), (F p2), (F p1), (F (NOT (OR p3 (NOT p1))))]
Knowledge based reduction with 9 factoid took 1310 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 339 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Stuttering acceptance computed with spot in 344 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Stuttering acceptance computed with spot in 339 ms :[(AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2 p3)]
Product exploration explored 100000 steps with 24971 reset in 368 ms.
Product exploration explored 100000 steps with 24977 reset in 407 ms.
Built C files in :
/tmp/ltsmin14811650203366065130
[2022-05-21 06:52:36] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14811650203366065130
Running compilation step : cd /tmp/ltsmin14811650203366065130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1862 ms.
Running link step : cd /tmp/ltsmin14811650203366065130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin14811650203366065130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7522526301193876366.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-21 06:52:51] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:52:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-21 06:52:51] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:52:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:52:51] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2022-05-21 06:52:51] [INFO ] Flow matrix only has 282 transitions (discarded 230 similar events)
// Phase 1: matrix 282 rows 149 cols
[2022-05-21 06:52:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:52:51] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/149 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin9576805686671919894
[2022-05-21 06:52:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9576805686671919894
Running compilation step : cd /tmp/ltsmin9576805686671919894;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1387 ms.
Running link step : cd /tmp/ltsmin9576805686671919894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9576805686671919894;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7002950671436031820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 06:53:07] [INFO ] Flatten gal took : 34 ms
[2022-05-21 06:53:07] [INFO ] Flatten gal took : 35 ms
[2022-05-21 06:53:07] [INFO ] Time to serialize gal into /tmp/LTL3147756410013187503.gal : 6 ms
[2022-05-21 06:53:07] [INFO ] Time to serialize properties into /tmp/LTL7449365132892432914.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3147756410013187503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7449365132892432914.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3147756...266
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((X(!(G("(p28==1)"))))U("((p12==1)&&(p213==1))"))U(X(((X("(p33==1)"))&&("(p41==1)"))&&("(p213==1)"))))))))
Formula 0 simplified : !FX!((X!G"(p28==1)" U "((p12==1)&&(p213==1))") U X("(p41==1)" & "(p213==1)" & X"(p33==1)"))
Reverse transition relation is NOT exact ! Due to transitions t27, t31, t33, t40, t44, t46, t53, t57, t59, t68, t70, t72, t80, t82, t84, t92, t94, t96, In...252
Detected timeout of ITS tools.
[2022-05-21 06:53:22] [INFO ] Flatten gal took : 49 ms
[2022-05-21 06:53:22] [INFO ] Applying decomposition
[2022-05-21 06:53:22] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15238289605671262248.txt' '-o' '/tmp/graph15238289605671262248.bin' '-w' '/tmp/graph15238289605671262248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15238289605671262248.bin' '-l' '-1' '-v' '-w' '/tmp/graph15238289605671262248.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:53:22] [INFO ] Decomposing Gal with order
[2022-05-21 06:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:53:22] [INFO ] Removed a total of 443 redundant transitions.
[2022-05-21 06:53:22] [INFO ] Flatten gal took : 161 ms
[2022-05-21 06:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 30 ms.
[2022-05-21 06:53:22] [INFO ] Time to serialize gal into /tmp/LTL9310730329780553575.gal : 9 ms
[2022-05-21 06:53:22] [INFO ] Time to serialize properties into /tmp/LTL2167198960932774748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9310730329780553575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2167198960932774748.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9310730...245
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((X(!(G("(i4.i1.u3.p28==1)"))))U("((i4.i0.u8.p12==1)&&(u41.p213==1))"))U(X(((X("(i7.u5.p33==1)"))&&("(i10.u7.p41==1)"))&&("(u...175
Formula 0 simplified : !FX!((X!G"(i4.i1.u3.p28==1)" U "((i4.i0.u8.p12==1)&&(u41.p213==1))") U X("(i10.u7.p41==1)" & "(u41.p213==1)" & X"(i7.u5.p33==1)"))
Reverse transition relation is NOT exact ! Due to transitions t33, t40, t44, t46, t53, t57, t59, t70, t72, t80, t82, t92, t94, i0.t31, i0.t27, i2.t68, i4.t...267
13 unique states visited
0 strongly connected components in search stack
18 transitions explored
7 items max in DFS search stack
133 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.38874,49068,1,0,61984,554,3156,103637,405,2023,178952
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtahNoC-PT-none-LTLFireability-11 finished in 93852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 156 transition count 554
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 156 transition count 554
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 156 transition count 538
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 152 transition count 526
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 152 transition count 526
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 152 transition count 520
Applied a total of 66 rules in 12 ms. Remains 152 /174 variables (removed 22) and now considering 520/636 (removed 116) transitions.
[2022-05-21 06:53:24] [INFO ] Flow matrix only has 274 transitions (discarded 246 similar events)
// Phase 1: matrix 274 rows 152 cols
[2022-05-21 06:53:24] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:53:24] [INFO ] Implicit Places using invariants in 122 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/174 places, 520/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 495
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 495
Applied a total of 10 rules in 4 ms. Remains 146 /151 variables (removed 5) and now considering 495/520 (removed 25) transitions.
[2022-05-21 06:53:24] [INFO ] Flow matrix only has 269 transitions (discarded 226 similar events)
// Phase 1: matrix 269 rows 146 cols
[2022-05-21 06:53:24] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:53:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-21 06:53:24] [INFO ] Flow matrix only has 269 transitions (discarded 226 similar events)
// Phase 1: matrix 269 rows 146 cols
[2022-05-21 06:53:24] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 06:53:24] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-21 06:53:24] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/174 places, 495/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 146/174 places, 495/636 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s67 1) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-12 finished in 547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Graph (trivial) has 272 edges and 174 vertex of which 70 / 174 are part of one of the 16 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 101 transition count 390
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 101 transition count 390
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 57 place count 101 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 96 transition count 359
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 96 transition count 359
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 96 transition count 352
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 93 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 93 transition count 345
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 91 transition count 339
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 91 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 91 transition count 337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 90 transition count 342
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 115 place count 90 transition count 319
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 90 transition count 319
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 89 transition count 318
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 89 transition count 318
Applied a total of 118 rules in 42 ms. Remains 89 /174 variables (removed 85) and now considering 318/636 (removed 318) transitions.
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 152 transitions (discarded 166 similar events)
// Phase 1: matrix 152 rows 89 cols
[2022-05-21 06:53:25] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 152 transitions (discarded 166 similar events)
// Phase 1: matrix 152 rows 89 cols
[2022-05-21 06:53:25] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-21 06:53:25] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-21 06:53:25] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 152 transitions (discarded 166 similar events)
// Phase 1: matrix 152 rows 89 cols
[2022-05-21 06:53:25] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/174 places, 318/636 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/174 places, 318/636 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-14 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 (EQ s3 1) (EQ s27 1)), p1:(OR (NEQ s63 1) (EQ s72 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 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-14 finished in 562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))&&G(X(X(G((X(p1)&&p2)))))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 636/636 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 156 transition count 554
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 156 transition count 554
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 51 place count 156 transition count 539
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 153 transition count 530
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 153 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 61 place count 153 transition count 526
Applied a total of 61 rules in 6 ms. Remains 153 /174 variables (removed 21) and now considering 526/636 (removed 110) transitions.
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 280 transitions (discarded 246 similar events)
// Phase 1: matrix 280 rows 153 cols
[2022-05-21 06:53:25] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] Implicit Places using invariants in 73 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 526/636 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 501
Applied a total of 10 rules in 3 ms. Remains 147 /152 variables (removed 5) and now considering 501/526 (removed 25) transitions.
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 275 transitions (discarded 226 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:53:25] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-05-21 06:53:25] [INFO ] Flow matrix only has 275 transitions (discarded 226 similar events)
// Phase 1: matrix 275 rows 147 cols
[2022-05-21 06:53:25] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 06:53:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-21 06:53:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/174 places, 501/636 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/174 places, 501/636 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s12 1), p2:(EQ s62 1), p1:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-15 finished in 488 ms.
All properties solved by simple procedures.
Total runtime 107752 ms.

BK_STOP 1653116006252

--------------------
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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r276-smll-165307352800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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