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.r150-smll-165276998500212.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 NoC3x3-PT-7A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:07 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.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653029746593

Running Version 202205111006
[2022-05-20 06:55:49] [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-20 06:55:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:55:49] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2022-05-20 06:55:49] [INFO ] Transformed 801 places.
[2022-05-20 06:55:49] [INFO ] Transformed 1544 transitions.
[2022-05-20 06:55:49] [INFO ] Found NUPN structural information;
[2022-05-20 06:55:49] [INFO ] Parsed PT model containing 801 places and 1544 transitions in 657 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 174 place count 627 transition count 1180
Ensure Unique test removed 39 places
Iterating global reduction 0 with 213 rules applied. Total rules applied 387 place count 588 transition count 1180
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 421 place count 588 transition count 1146
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 437 place count 588 transition count 1130
Applied a total of 437 rules in 217 ms. Remains 588 /801 variables (removed 213) and now considering 1130/1437 (removed 307) transitions.
[2022-05-20 06:55:50] [INFO ] Flow matrix only has 1128 transitions (discarded 2 similar events)
// Phase 1: matrix 1128 rows 588 cols
[2022-05-20 06:55:50] [INFO ] Computed 72 place invariants in 52 ms
[2022-05-20 06:55:51] [INFO ] Implicit Places using invariants in 703 ms returned [10, 156, 218, 301, 445, 497, 554]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 765 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 581/801 places, 1130/1437 transitions.
Applied a total of 0 rules in 12 ms. Remains 581 /581 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 581/801 places, 1130/1437 transitions.
Support contains 44 out of 581 places after structural reductions.
[2022-05-20 06:55:51] [INFO ] Flatten gal took : 254 ms
[2022-05-20 06:55:51] [INFO ] Flatten gal took : 153 ms
[2022-05-20 06:55:52] [INFO ] Input system was already deterministic with 1130 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 29) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-20 06:55:52] [INFO ] Flow matrix only has 1128 transitions (discarded 2 similar events)
// Phase 1: matrix 1128 rows 581 cols
[2022-05-20 06:55:53] [INFO ] Computed 65 place invariants in 17 ms
[2022-05-20 06:55:53] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2022-05-20 06:55:53] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-20 06:55:54] [INFO ] After 1406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:55:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-05-20 06:55:54] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-20 06:55:55] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:55:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-20 06:55:55] [INFO ] After 265ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 06:55:56] [INFO ] After 836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 330 ms.
[2022-05-20 06:55:56] [INFO ] After 2006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 262 ms.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 702 edges and 581 vertex of which 107 / 581 are part of one of the 9 SCC in 8 ms
Free SCC test removed 98 places
Drop transitions removed 195 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 242 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 483 transition count 876
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 471 transition count 876
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 466 transition count 869
Ensure Unique test removed 3 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 463 transition count 869
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 463 transition count 864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 461 transition count 864
Performed 133 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 311 place count 328 transition count 698
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 391 place count 328 transition count 618
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 419 place count 314 transition count 598
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 429 place count 314 transition count 588
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 459 place count 299 transition count 597
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 463 place count 299 transition count 593
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 7 with 75 rules applied. Total rules applied 538 place count 299 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 540 place count 297 transition count 518
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 540 place count 297 transition count 514
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 548 place count 293 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 550 place count 292 transition count 513
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 553 place count 292 transition count 510
Free-agglomeration rule applied 43 times with reduction of 24 identical transitions.
Iterating global reduction 8 with 43 rules applied. Total rules applied 596 place count 292 transition count 443
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 70 rules applied. Total rules applied 666 place count 249 transition count 416
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 673 place count 249 transition count 409
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 675 place count 249 transition count 407
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 679 place count 247 transition count 405
Free-agglomeration rule (complex) applied 18 times with reduction of 2 identical transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 697 place count 247 transition count 445
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 722 place count 229 transition count 438
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 11 with 34 rules applied. Total rules applied 756 place count 229 transition count 404
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 792 place count 229 transition count 404
Applied a total of 792 rules in 434 ms. Remains 229 /581 variables (removed 352) and now considering 404/1130 (removed 726) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/581 places, 404/1130 transitions.
Finished random walk after 578 steps, including 0 resets, run visited all 5 properties in 20 ms. (steps per millisecond=28 )
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(F(p0)))) U G(p1)))'
Support contains 3 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 709 edges and 581 vertex of which 107 / 581 are part of one of the 9 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 480 transition count 884
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 465 transition count 882
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 457 transition count 872
Ensure Unique test removed 5 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 452 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 452 transition count 869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 451 transition count 869
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 351 place count 304 transition count 680
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 432 place count 304 transition count 599
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 460 place count 290 transition count 579
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 470 place count 290 transition count 569
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 498 place count 276 transition count 577
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 503 place count 276 transition count 572
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 7 with 72 rules applied. Total rules applied 575 place count 276 transition count 500
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 576 place count 276 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 577 place count 275 transition count 499
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 578 place count 275 transition count 498
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 579 place count 275 transition count 498
Applied a total of 579 rules in 199 ms. Remains 275 /581 variables (removed 306) and now considering 498/1130 (removed 632) transitions.
// Phase 1: matrix 498 rows 275 cols
[2022-05-20 06:55:57] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-20 06:55:58] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 498 rows 275 cols
[2022-05-20 06:55:58] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-20 06:55:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 06:55:58] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2022-05-20 06:55:59] [INFO ] Redundant transitions in 310 ms returned [384, 390, 392, 393, 400, 406, 408, 412, 417, 419, 420, 422, 423, 429, 431, 433, 438, 440, 441]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 479 rows 275 cols
[2022-05-20 06:55:59] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-20 06:55:59] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/581 places, 479/1130 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 474
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 474
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 265 transition count 469
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 263 transition count 469
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 263 transition count 467
Applied a total of 26 rules in 57 ms. Remains 263 /275 variables (removed 12) and now considering 467/479 (removed 12) transitions.
// Phase 1: matrix 467 rows 263 cols
[2022-05-20 06:55:59] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-20 06:55:59] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 467 rows 263 cols
[2022-05-20 06:55:59] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-20 06:56:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 06:56:00] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 263/581 places, 467/1130 transitions.
Finished structural reductions, in 2 iterations. Remains : 263/581 places, 467/1130 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s248 1), p0:(AND (EQ s148 1) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 3060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(X(F(!(!p0 U !p1))))))))'
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 712 edges and 581 vertex of which 107 / 581 are part of one of the 9 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 483 transition count 886
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 472 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 471 transition count 885
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 34 place count 462 transition count 874
Ensure Unique test removed 6 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 49 place count 456 transition count 874
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 54 place count 456 transition count 869
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 454 transition count 869
Performed 144 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 288 rules applied. Total rules applied 344 place count 310 transition count 691
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 5 with 85 rules applied. Total rules applied 429 place count 310 transition count 606
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 459 place count 295 transition count 585
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 470 place count 295 transition count 574
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 498 place count 281 transition count 582
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 503 place count 281 transition count 577
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 573 place count 281 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 575 place count 279 transition count 507
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 575 place count 279 transition count 504
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 581 place count 276 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 583 place count 275 transition count 503
Applied a total of 583 rules in 128 ms. Remains 275 /581 variables (removed 306) and now considering 503/1130 (removed 627) transitions.
[2022-05-20 06:56:00] [INFO ] Flow matrix only has 495 transitions (discarded 8 similar events)
// Phase 1: matrix 495 rows 275 cols
[2022-05-20 06:56:00] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:01] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-20 06:56:01] [INFO ] Flow matrix only has 495 transitions (discarded 8 similar events)
// Phase 1: matrix 495 rows 275 cols
[2022-05-20 06:56:01] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 06:56:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-20 06:56:01] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2022-05-20 06:56:01] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-20 06:56:01] [INFO ] Flow matrix only has 495 transitions (discarded 8 similar events)
// Phase 1: matrix 495 rows 275 cols
[2022-05-20 06:56:01] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:01] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/581 places, 503/1130 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/581 places, 503/1130 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s217 1) (EQ s226 1)), p0:(AND (EQ s36 1) (EQ s66 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 1294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(p0)||p1) U p2)))'
Support contains 8 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 574 transition count 1122
Ensure Unique test removed 5 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 569 transition count 1122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 569 transition count 1119
Applied a total of 22 rules in 28 ms. Remains 569 /581 variables (removed 12) and now considering 1119/1130 (removed 11) transitions.
[2022-05-20 06:56:02] [INFO ] Flow matrix only has 1117 transitions (discarded 2 similar events)
// Phase 1: matrix 1117 rows 569 cols
[2022-05-20 06:56:02] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-20 06:56:02] [INFO ] Implicit Places using invariants in 300 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 305 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 568/581 places, 1119/1130 transitions.
Applied a total of 0 rules in 11 ms. Remains 568 /568 variables (removed 0) and now considering 1119/1119 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 568/581 places, 1119/1130 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), true, (OR (NOT p2) p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s77 1) (EQ s94 1) (EQ s227 1) (EQ s431 1)), p1:(AND (EQ s209 1) (EQ s241 1)), p0:(AND (EQ s372 1) (EQ s382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-02 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X((F(p0)||p1))))||G(F(G(p2)))))'
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 571 transition count 1117
Ensure Unique test removed 6 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 565 transition count 1117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 565 transition count 1114
Applied a total of 29 rules in 22 ms. Remains 565 /581 variables (removed 16) and now considering 1114/1130 (removed 16) transitions.
// Phase 1: matrix 1114 rows 565 cols
[2022-05-20 06:56:02] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-20 06:56:02] [INFO ] Implicit Places using invariants in 203 ms returned [77, 370]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 207 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/581 places, 1114/1130 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 563/581 places, 1114/1130 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s377 1), p1:(AND (EQ s469 1) (EQ s520 1)), p2:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 210 reset in 1039 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 1416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 710 edges and 581 vertex of which 107 / 581 are part of one of the 9 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 483 transition count 885
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 471 transition count 885
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 463 transition count 875
Ensure Unique test removed 6 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 457 transition count 875
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 457 transition count 870
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 455 transition count 870
Performed 137 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 328 place count 318 transition count 700
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 410 place count 318 transition count 618
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 440 place count 303 transition count 597
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 451 place count 303 transition count 586
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 479 place count 289 transition count 594
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 484 place count 289 transition count 589
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 7 with 73 rules applied. Total rules applied 557 place count 289 transition count 516
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 560 place count 287 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 561 place count 286 transition count 515
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 561 place count 286 transition count 512
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 567 place count 283 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 569 place count 282 transition count 511
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 570 place count 282 transition count 511
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 571 place count 281 transition count 510
Iterating global reduction 9 with 1 rules applied. Total rules applied 572 place count 281 transition count 510
Applied a total of 572 rules in 100 ms. Remains 281 /581 variables (removed 300) and now considering 510/1130 (removed 620) transitions.
[2022-05-20 06:56:04] [INFO ] Flow matrix only has 502 transitions (discarded 8 similar events)
// Phase 1: matrix 502 rows 281 cols
[2022-05-20 06:56:04] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 06:56:04] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-20 06:56:04] [INFO ] Flow matrix only has 502 transitions (discarded 8 similar events)
// Phase 1: matrix 502 rows 281 cols
[2022-05-20 06:56:04] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-20 06:56:04] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2022-05-20 06:56:04] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-20 06:56:04] [INFO ] Flow matrix only has 502 transitions (discarded 8 similar events)
// Phase 1: matrix 502 rows 281 cols
[2022-05-20 06:56:04] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:05] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/581 places, 510/1130 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/581 places, 510/1130 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s203 1) (EQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 1506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U p1))'
Support contains 3 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 706 edges and 581 vertex of which 107 / 581 are part of one of the 9 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 483 transition count 886
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 472 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 471 transition count 885
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 34 place count 462 transition count 874
Ensure Unique test removed 6 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 49 place count 456 transition count 874
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 54 place count 456 transition count 869
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 454 transition count 869
Performed 141 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 141 places in 1 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 5 with 282 rules applied. Total rules applied 338 place count 313 transition count 695
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 5 with 83 rules applied. Total rules applied 421 place count 313 transition count 612
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 449 place count 299 transition count 592
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 459 place count 299 transition count 582
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 487 place count 285 transition count 590
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 492 place count 285 transition count 585
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 8 with 69 rules applied. Total rules applied 561 place count 285 transition count 516
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 563 place count 283 transition count 516
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 563 place count 283 transition count 512
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 571 place count 279 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 573 place count 278 transition count 511
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 575 place count 278 transition count 509
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 576 place count 278 transition count 509
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 577 place count 278 transition count 508
Applied a total of 577 rules in 112 ms. Remains 278 /581 variables (removed 303) and now considering 508/1130 (removed 622) transitions.
[2022-05-20 06:56:05] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
// Phase 1: matrix 500 rows 278 cols
[2022-05-20 06:56:05] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 06:56:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2022-05-20 06:56:05] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
// Phase 1: matrix 500 rows 278 cols
[2022-05-20 06:56:05] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:05] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-20 06:56:06] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2022-05-20 06:56:06] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-20 06:56:06] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
// Phase 1: matrix 500 rows 278 cols
[2022-05-20 06:56:06] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:06] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/581 places, 508/1130 transitions.
Finished structural reductions, in 1 iterations. Remains : 278/581 places, 508/1130 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, p1, (AND p1 p0), p0]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s106 1), p0:(AND (EQ s222 1) (EQ s226 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 468 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-06 finished in 1220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((X(p0)&&p1) U (G(p1)||p2))))))'
Support contains 4 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 572 transition count 1118
Ensure Unique test removed 5 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 23 place count 567 transition count 1118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 567 transition count 1115
Applied a total of 26 rules in 25 ms. Remains 567 /581 variables (removed 14) and now considering 1115/1130 (removed 15) transitions.
// Phase 1: matrix 1115 rows 567 cols
[2022-05-20 06:56:06] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-20 06:56:07] [INFO ] Implicit Places using invariants in 383 ms returned [77, 371]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 386 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/581 places, 1115/1130 transitions.
Applied a total of 0 rules in 10 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 565/581 places, 1115/1130 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(NEQ s496 1), p1:(EQ s230 1), p0:(AND (EQ s369 1) (EQ s417 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67475 steps with 0 reset in 352 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-07 finished in 1092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p1)&&p0))))'
Support contains 3 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 572 transition count 1118
Ensure Unique test removed 5 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 23 place count 567 transition count 1118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 25 place count 567 transition count 1116
Applied a total of 25 rules in 15 ms. Remains 567 /581 variables (removed 14) and now considering 1116/1130 (removed 14) transitions.
// Phase 1: matrix 1116 rows 567 cols
[2022-05-20 06:56:07] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-20 06:56:07] [INFO ] Implicit Places using invariants in 202 ms returned [77, 372]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 204 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/581 places, 1116/1130 transitions.
Applied a total of 0 rules in 9 ms. Remains 565 /565 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 565/581 places, 1116/1130 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s291 1) (EQ s298 1)), p1:(OR (EQ s13 0) (EQ s291 0) (EQ s298 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32 reset in 453 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U p1))||G(X(p2)))))'
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 705 edges and 581 vertex of which 86 / 581 are part of one of the 8 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 500 transition count 934
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 487 transition count 932
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 37 place count 478 transition count 921
Ensure Unique test removed 6 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 52 place count 472 transition count 921
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 472 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 471 transition count 918
Performed 157 Post agglomeration using F-continuation condition with reduction of 44 identical transitions.
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 4 with 314 rules applied. Total rules applied 370 place count 314 transition count 717
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 457 place count 314 transition count 630
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 487 place count 299 transition count 609
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 498 place count 299 transition count 598
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 528 place count 284 transition count 607
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 533 place count 284 transition count 602
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 7 with 76 rules applied. Total rules applied 609 place count 284 transition count 526
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 609 place count 284 transition count 525
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 611 place count 283 transition count 525
Applied a total of 611 rules in 81 ms. Remains 283 /581 variables (removed 298) and now considering 525/1130 (removed 605) transitions.
// Phase 1: matrix 525 rows 283 cols
[2022-05-20 06:56:08] [INFO ] Computed 54 place invariants in 5 ms
[2022-05-20 06:56:08] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 525 rows 283 cols
[2022-05-20 06:56:08] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 06:56:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 06:56:09] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2022-05-20 06:56:09] [INFO ] Redundant transitions in 174 ms returned [403, 409, 411, 412, 419, 425, 427, 431, 435, 437, 438, 440, 441, 447, 449, 451, 456, 458, 459]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 506 rows 283 cols
[2022-05-20 06:56:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 06:56:09] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/581 places, 506/1130 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 283 transition count 501
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 278 transition count 501
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 273 transition count 496
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 271 transition count 496
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 271 transition count 494
Applied a total of 26 rules in 23 ms. Remains 271 /283 variables (removed 12) and now considering 494/506 (removed 12) transitions.
// Phase 1: matrix 494 rows 271 cols
[2022-05-20 06:56:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 06:56:09] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 494 rows 271 cols
[2022-05-20 06:56:09] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 06:56:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 06:56:10] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 271/581 places, 494/1130 transitions.
Finished structural reductions, in 2 iterations. Remains : 271/581 places, 494/1130 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (EQ s224 1) (EQ s73 1)), p1:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-10 finished in 1800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((G(X(p0))||p1)&&(F(p2) U p1)) U !X(p3)))'
Support contains 5 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 572 transition count 1119
Ensure Unique test removed 6 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 24 place count 566 transition count 1119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 566 transition count 1117
Applied a total of 26 rules in 19 ms. Remains 566 /581 variables (removed 15) and now considering 1117/1130 (removed 13) transitions.
// Phase 1: matrix 1117 rows 566 cols
[2022-05-20 06:56:10] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-20 06:56:10] [INFO ] Implicit Places using invariants in 276 ms returned [371]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/581 places, 1117/1130 transitions.
Applied a total of 0 rules in 10 ms. Remains 565 /565 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 565/581 places, 1117/1130 transitions.
Stuttering acceptance computed with spot in 496 ms :[p3, p3, (AND p0 p1 p2 p3), p3, (AND p0 p1 p3), true, p0, (AND p0 p2 p1), (AND p0 p2), (AND p0 p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p3, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1 p3 p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p1) p3 p0), acceptance={} source=2 dest: 9}], [{ cond=(AND p1 p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p3 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p1) p3 p0), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s78 1) (EQ s127 1)), p2:(EQ s46 1), p3:(EQ s35 1), p0:(EQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2540 ms.
Product exploration explored 100000 steps with 50000 reset in 2065 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND p2 p1 p3 p0))), (X (NOT (AND (NOT p2) p1 p3 p0))), (X (NOT (AND p2 (NOT p1) p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p2 (NOT p1) p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 p3 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 30 factoid took 546 ms. Reduced automaton from 10 states, 27 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-7A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 6001 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Graph (trivial) has 709 edges and 581 vertex of which 100 / 581 are part of one of the 9 SCC in 0 ms
Free SCC test removed 91 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 903
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 903
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 32 place count 470 transition count 892
Ensure Unique test removed 6 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 464 transition count 892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 464 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 463 transition count 889
Performed 148 Post agglomeration using F-continuation condition with reduction of 35 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 347 place count 315 transition count 706
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 433 place count 315 transition count 620
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 463 place count 300 transition count 599
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 474 place count 300 transition count 588
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 502 place count 286 transition count 596
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 507 place count 286 transition count 591
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 7 with 73 rules applied. Total rules applied 580 place count 286 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 582 place count 284 transition count 518
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 582 place count 284 transition count 515
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 588 place count 281 transition count 515
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 590 place count 280 transition count 514
Applied a total of 590 rules in 85 ms. Remains 280 /581 variables (removed 301) and now considering 514/1130 (removed 616) transitions.
[2022-05-20 06:56:16] [INFO ] Flow matrix only has 506 transitions (discarded 8 similar events)
// Phase 1: matrix 506 rows 280 cols
[2022-05-20 06:56:16] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:16] [INFO ] Implicit Places using invariants in 229 ms returned []
[2022-05-20 06:56:16] [INFO ] Flow matrix only has 506 transitions (discarded 8 similar events)
// Phase 1: matrix 506 rows 280 cols
[2022-05-20 06:56:16] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:17] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-20 06:56:17] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2022-05-20 06:56:17] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-20 06:56:17] [INFO ] Flow matrix only has 506 transitions (discarded 8 similar events)
// Phase 1: matrix 506 rows 280 cols
[2022-05-20 06:56:17] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 06:56:17] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/581 places, 514/1130 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/581 places, 514/1130 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s194 1) (EQ s217 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 1661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !(F(X(!G(F(p1)))) U X(!p1))))'
Support contains 3 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 1130/1130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 572 transition count 1118
Ensure Unique test removed 5 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 23 place count 567 transition count 1118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 567 transition count 1115
Applied a total of 26 rules in 24 ms. Remains 567 /581 variables (removed 14) and now considering 1115/1130 (removed 15) transitions.
// Phase 1: matrix 1115 rows 567 cols
[2022-05-20 06:56:18] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-20 06:56:18] [INFO ] Implicit Places using invariants in 371 ms returned [77, 370]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/581 places, 1115/1130 transitions.
Applied a total of 0 rules in 11 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 565/581 places, 1115/1130 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s106 1), p0:(AND (EQ s472 1) (EQ s493 1))], 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]]
Product exploration explored 100000 steps with 379 reset in 733 ms.
Stack based approach found an accepted trace after 377 steps with 1 reset with depth 224 and stack size 224 in 3 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 1390 ms.
All properties solved by simple procedures.
Total runtime 30256 ms.

BK_STOP 1653029779515

--------------------
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="NoC3x3-PT-7A"
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 NoC3x3-PT-7A, 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 r150-smll-165276998500212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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