Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700408.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-7A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700408
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 07:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 07:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 355K May 18 16:43 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 1716694505802

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 03:35:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:35:07] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-26 03:35:07] [INFO ] Transformed 801 places.
[2024-05-26 03:35:07] [INFO ] Transformed 1544 transitions.
[2024-05-26 03:35:07] [INFO ] Found NUPN structural information;
[2024-05-26 03:35:07] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 628 transition count 1189
Ensure Unique test removed 42 places
Iterating global reduction 0 with 215 rules applied. Total rules applied 388 place count 586 transition count 1189
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 421 place count 586 transition count 1156
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 441 place count 586 transition count 1136
Applied a total of 441 rules in 101 ms. Remains 586 /801 variables (removed 215) and now considering 1136/1437 (removed 301) transitions.
[2024-05-26 03:35:07] [INFO ] Flow matrix only has 1130 transitions (discarded 6 similar events)
// Phase 1: matrix 1130 rows 586 cols
[2024-05-26 03:35:08] [INFO ] Computed 69 invariants in 30 ms
[2024-05-26 03:35:08] [INFO ] Implicit Places using invariants in 367 ms returned [10, 81, 156, 218, 301, 443, 495]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 513 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 579/801 places, 1136/1437 transitions.
Applied a total of 0 rules in 11 ms. Remains 579 /579 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 626 ms. Remains : 579/801 places, 1136/1437 transitions.
Support contains 45 out of 579 places after structural reductions.
[2024-05-26 03:35:08] [INFO ] Flatten gal took : 94 ms
[2024-05-26 03:35:08] [INFO ] Flatten gal took : 52 ms
[2024-05-26 03:35:08] [INFO ] Input system was already deterministic with 1136 transitions.
Support contains 44 out of 579 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :1
Running SMT prover for 3 properties.
[2024-05-26 03:35:09] [INFO ] Flow matrix only has 1130 transitions (discarded 6 similar events)
// Phase 1: matrix 1130 rows 579 cols
[2024-05-26 03:35:09] [INFO ] Computed 62 invariants in 11 ms
[2024-05-26 03:35:09] [INFO ] [Real]Absence check using 59 positive place invariants in 23 ms returned sat
[2024-05-26 03:35:09] [INFO ] [Real]Absence check using 59 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 03:35:10] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-26 03:35:10] [INFO ] [Nat]Absence check using 59 positive place invariants in 17 ms returned sat
[2024-05-26 03:35:10] [INFO ] [Nat]Absence check using 59 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 03:35:10] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-26 03:35:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-26 03:35:10] [INFO ] After 67ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-26 03:35:10] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-26 03:35:10] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 709 edges and 579 vertex of which 107 / 579 are part of one of the 9 SCC in 4 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 481 transition count 882
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 469 transition count 882
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 461 transition count 870
Ensure Unique test removed 2 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 459 transition count 870
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 49 place count 459 transition count 864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 457 transition count 864
Performed 142 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 335 place count 315 transition count 690
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 422 place count 315 transition count 603
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 450 place count 301 transition count 583
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 460 place count 301 transition count 573
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
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 488 place count 287 transition count 580
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 493 place count 287 transition count 575
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 564 place count 287 transition count 504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 566 place count 285 transition count 504
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 566 place count 285 transition count 500
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 574 place count 281 transition count 500
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 576 place count 280 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 578 place count 279 transition count 499
Free-agglomeration rule applied 40 times with reduction of 24 identical transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 618 place count 279 transition count 435
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 69 rules applied. Total rules applied 687 place count 239 transition count 406
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 694 place count 239 transition count 399
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 696 place count 239 transition count 397
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 700 place count 237 transition count 395
Free-agglomeration rule (complex) applied 16 times with reduction of 2 identical transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 716 place count 237 transition count 429
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 739 place count 221 transition count 422
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 11 with 28 rules applied. Total rules applied 767 place count 221 transition count 394
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 803 place count 221 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 804 place count 220 transition count 393
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 807 place count 217 transition count 393
Applied a total of 807 rules in 204 ms. Remains 217 /579 variables (removed 362) and now considering 393/1136 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 217/579 places, 393/1136 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:35:11] [INFO ] Flow matrix only has 390 transitions (discarded 3 similar events)
// Phase 1: matrix 390 rows 217 cols
[2024-05-26 03:35:11] [INFO ] Computed 55 invariants in 3 ms
[2024-05-26 03:35:11] [INFO ] [Real]Absence check using 54 positive place invariants in 6 ms returned sat
[2024-05-26 03:35:11] [INFO ] [Real]Absence check using 54 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-26 03:35:11] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:35:11] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2024-05-26 03:35:11] [INFO ] [Nat]Absence check using 54 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-26 03:35:11] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:35:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:35:11] [INFO ] After 16ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:35:11] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-26 03:35:11] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 393/393 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 216 transition count 392
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 215 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 2 rules applied. Total rules applied 5 place count 215 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 214 transition count 390
Applied a total of 6 rules in 17 ms. Remains 214 /217 variables (removed 3) and now considering 390/393 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 214/217 places, 390/393 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1040521 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1040521 steps, saw 851017 distinct states, run finished after 3004 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:35:14] [INFO ] Flow matrix only has 387 transitions (discarded 3 similar events)
// Phase 1: matrix 387 rows 214 cols
[2024-05-26 03:35:14] [INFO ] Computed 54 invariants in 2 ms
[2024-05-26 03:35:14] [INFO ] [Real]Absence check using 54 positive place invariants in 7 ms returned sat
[2024-05-26 03:35:14] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:35:15] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2024-05-26 03:35:15] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:35:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:35:15] [INFO ] After 15ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:35:15] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-26 03:35:15] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 390/390 transitions.
Applied a total of 0 rules in 11 ms. Remains 214 /214 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 214/214 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 390/390 transitions.
Applied a total of 0 rules in 7 ms. Remains 214 /214 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2024-05-26 03:35:15] [INFO ] Flow matrix only has 387 transitions (discarded 3 similar events)
[2024-05-26 03:35:15] [INFO ] Invariant cache hit.
[2024-05-26 03:35:15] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-26 03:35:15] [INFO ] Flow matrix only has 387 transitions (discarded 3 similar events)
[2024-05-26 03:35:15] [INFO ] Invariant cache hit.
[2024-05-26 03:35:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:35:15] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-26 03:35:15] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-26 03:35:15] [INFO ] Flow matrix only has 387 transitions (discarded 3 similar events)
[2024-05-26 03:35:15] [INFO ] Invariant cache hit.
[2024-05-26 03:35:15] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 688 ms. Remains : 214/214 places, 390/390 transitions.
Graph (trivial) has 132 edges and 214 vertex of which 34 / 214 are part of one of the 13 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions removed 34 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 672 edges and 193 vertex of which 183 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 115 edges and 180 vertex of which 9 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 174 transition count 341
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (trivial) has 103 edges and 172 vertex of which 2 / 172 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 27 rules applied. Total rules applied 45 place count 171 transition count 317
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 171 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 170 transition count 314
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 72 place count 170 transition count 291
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 170 transition count 291
Applied a total of 73 rules in 29 ms. Remains 170 /214 variables (removed 44) and now considering 291/390 (removed 99) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 170 cols
[2024-05-26 03:35:15] [INFO ] Computed 45 invariants in 2 ms
[2024-05-26 03:35:15] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-26 03:35:16] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:35:16] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2024-05-26 03:35:16] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:35:16] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-26 03:35:16] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p1)))))'
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 570 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 567 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 567 transition count 1118
Applied a total of 24 rules in 24 ms. Remains 567 /579 variables (removed 12) and now considering 1118/1136 (removed 18) transitions.
// Phase 1: matrix 1118 rows 567 cols
[2024-05-26 03:35:16] [INFO ] Computed 59 invariants in 4 ms
[2024-05-26 03:35:16] [INFO ] Implicit Places using invariants in 146 ms returned [370, 533]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1118/1136 transitions.
Applied a total of 0 rules in 12 ms. Remains 565 /565 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 565/579 places, 1118/1136 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 260 ms :[p1, p1, p1, true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s364 1) (EQ s403 1)) (EQ s45 1)), p0:(AND (EQ s281 1) (EQ s353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 824 steps with 0 reset in 24 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p0))))||F(p1)))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 566 transition count 1117
Applied a total of 27 rules in 11 ms. Remains 566 /579 variables (removed 13) and now considering 1117/1136 (removed 19) transitions.
[2024-05-26 03:35:17] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 566 cols
[2024-05-26 03:35:17] [INFO ] Computed 59 invariants in 4 ms
[2024-05-26 03:35:17] [INFO ] Implicit Places using invariants in 140 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1117/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 564/579 places, 1117/1136 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(AND (EQ s65 1) (EQ s83 1)), p0:(EQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 444 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 177 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1||X(p2))))&&p0)))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 566 transition count 1117
Applied a total of 27 rules in 13 ms. Remains 566 /579 variables (removed 13) and now considering 1117/1136 (removed 19) transitions.
[2024-05-26 03:35:17] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 566 cols
[2024-05-26 03:35:17] [INFO ] Computed 59 invariants in 4 ms
[2024-05-26 03:35:18] [INFO ] Implicit Places using invariants in 250 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 260 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1117/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 278 ms. Remains : 564/579 places, 1117/1136 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s103 1) (OR (EQ s207 0) (EQ s331 0))), p1:(AND (EQ s207 1) (EQ s331 1)), p2:(EQ s337 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-02 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 712 edges and 579 vertex of which 107 / 579 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.
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 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 455 transition count 874
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 452 transition count 874
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 57 place count 452 transition count 868
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 448 transition count 866
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 357 place count 301 transition count 677
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 438 place count 301 transition count 596
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 468 place count 286 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 479 place count 286 transition count 564
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 507 place count 272 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 512 place count 272 transition count 567
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 7 with 70 rules applied. Total rules applied 582 place count 272 transition count 497
Applied a total of 582 rules in 71 ms. Remains 272 /579 variables (removed 307) and now considering 497/1136 (removed 639) transitions.
// Phase 1: matrix 497 rows 272 cols
[2024-05-26 03:35:18] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:18] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-26 03:35:18] [INFO ] Invariant cache hit.
[2024-05-26 03:35:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:18] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-26 03:35:19] [INFO ] Redundant transitions in 115 ms returned [383, 389, 391, 392, 399, 405, 407, 411, 415, 417, 418, 420, 421, 427, 429, 431, 436, 438, 439]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 478 rows 272 cols
[2024-05-26 03:35:19] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:19] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/579 places, 478/1136 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 272 transition count 473
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 267 transition count 473
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 262 transition count 468
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 260 transition count 468
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 260 transition count 466
Applied a total of 26 rules in 18 ms. Remains 260 /272 variables (removed 12) and now considering 466/478 (removed 12) transitions.
// Phase 1: matrix 466 rows 260 cols
[2024-05-26 03:35:19] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:19] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-26 03:35:19] [INFO ] Invariant cache hit.
[2024-05-26 03:35:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/579 places, 466/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1261 ms. Remains : 260/579 places, 466/1136 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s125 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 NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 1305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1||(p2&&X(p1))))))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1119
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 566 transition count 1116
Applied a total of 26 rules in 11 ms. Remains 566 /579 variables (removed 13) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 566 cols
[2024-05-26 03:35:19] [INFO ] Computed 59 invariants in 3 ms
[2024-05-26 03:35:19] [INFO ] Implicit Places using invariants in 133 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 4 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 564/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(EQ s447 0), p2:(OR (EQ s202 0) (EQ s270 0)), p0:(AND (EQ s202 1) (EQ s270 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 449 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)&&(p2||F(p3))))))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1119
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 566 transition count 1116
Applied a total of 26 rules in 17 ms. Remains 566 /579 variables (removed 13) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 566 cols
[2024-05-26 03:35:20] [INFO ] Computed 59 invariants in 5 ms
[2024-05-26 03:35:20] [INFO ] Implicit Places using invariants in 142 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 7 ms. Remains 565 /565 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 565/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p0 p1 p2) (AND p0 p1 p3)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s370 0) (EQ s393 0)), p0:(OR (EQ s280 0) (EQ s357 0)), p2:(AND (EQ s370 1) (EQ s393 1)), p3:(AND (EQ s280 1) (EQ s357 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-05 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(p0))||(!p1&&F(!p2))) U (p0&&(X(G(p0))||(!p1&&F(!p2)))))))'
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 570 transition count 1122
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 567 transition count 1122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 25 place count 567 transition count 1118
Applied a total of 25 rules in 14 ms. Remains 567 /579 variables (removed 12) and now considering 1118/1136 (removed 18) transitions.
[2024-05-26 03:35:21] [INFO ] Flow matrix only has 1116 transitions (discarded 2 similar events)
// Phase 1: matrix 1116 rows 567 cols
[2024-05-26 03:35:21] [INFO ] Computed 59 invariants in 5 ms
[2024-05-26 03:35:21] [INFO ] Implicit Places using invariants in 143 ms returned [371, 533]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1118/1136 transitions.
Applied a total of 0 rules in 7 ms. Remains 565 /565 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 565/579 places, 1118/1136 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), true, p2]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s217 1), p1:(AND (EQ s240 1) (EQ s290 1)), p2:(AND (EQ s69 1) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1286 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 707 edges and 579 vertex of which 107 / 579 are part of one of the 9 SCC in 2 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 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 455 transition count 874
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 452 transition count 874
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 57 place count 452 transition count 868
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 448 transition count 866
Performed 146 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 355 place count 302 transition count 678
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 435 place count 302 transition count 598
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 459 place count 290 transition count 583
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 469 place count 290 transition count 573
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 497 place count 276 transition count 581
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 502 place count 276 transition count 576
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 573 place count 276 transition count 505
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 573 place count 276 transition count 504
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 575 place count 275 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 577 place count 274 transition count 504
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 581 place count 274 transition count 500
Applied a total of 581 rules in 62 ms. Remains 274 /579 variables (removed 305) and now considering 500/1136 (removed 636) transitions.
// Phase 1: matrix 500 rows 274 cols
[2024-05-26 03:35:21] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:21] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-26 03:35:21] [INFO ] Invariant cache hit.
[2024-05-26 03:35:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:21] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-26 03:35:22] [INFO ] Redundant transitions in 146 ms returned [384, 390, 392, 393, 400, 406, 408, 412, 416, 418, 419, 421, 422, 428, 430, 432, 437, 439, 440]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 481 rows 274 cols
[2024-05-26 03:35:22] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:22] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/579 places, 481/1136 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 274 transition count 476
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 269 transition count 476
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 264 transition count 471
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 262 transition count 471
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 262 transition count 469
Applied a total of 26 rules in 47 ms. Remains 262 /274 variables (removed 12) and now considering 469/481 (removed 12) transitions.
// Phase 1: matrix 469 rows 262 cols
[2024-05-26 03:35:22] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-26 03:35:22] [INFO ] Invariant cache hit.
[2024-05-26 03:35:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:22] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/579 places, 469/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1460 ms. Remains : 262/579 places, 469/1136 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s107 1), p1:(EQ s11 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 NoC3x3-PT-7A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-10 finished in 1596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(!p0)) U p1))))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 567 transition count 1119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 567 transition count 1116
Applied a total of 25 rules in 9 ms. Remains 567 /579 variables (removed 12) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 567 cols
[2024-05-26 03:35:23] [INFO ] Computed 60 invariants in 2 ms
[2024-05-26 03:35:23] [INFO ] Implicit Places using invariants in 126 ms returned [369, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 4 ms. Remains 565 /565 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 565/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s198 1) (EQ s270 1)), p0:(AND (EQ s530 1) (EQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 130 reset in 368 ms.
Stack based approach found an accepted trace after 1151 steps with 0 reset with depth 1152 and stack size 1138 in 5 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-11 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 568 transition count 1118
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 25 place count 565 transition count 1118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 29 place count 565 transition count 1114
Applied a total of 29 rules in 15 ms. Remains 565 /579 variables (removed 14) and now considering 1114/1136 (removed 22) transitions.
// Phase 1: matrix 1114 rows 565 cols
[2024-05-26 03:35:23] [INFO ] Computed 59 invariants in 6 ms
[2024-05-26 03:35:23] [INFO ] Implicit Places using invariants in 134 ms returned [369, 531]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/579 places, 1114/1136 transitions.
Applied a total of 0 rules in 4 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 563/579 places, 1114/1136 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-12 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: 2}]], initial=1, aps=[p0:(AND (EQ s198 1) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-12 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F(X(((F(p2)||(p3 U p4))&&p1)))&&p0)))))'
Support contains 7 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 702 edges and 579 vertex of which 106 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 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 482 transition count 896
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 471 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 470 transition count 895
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 35 place count 460 transition count 879
Ensure Unique test removed 3 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 48 place count 457 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 54 place count 457 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 455 transition count 873
Performed 142 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 340 place count 313 transition count 699
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 426 place count 313 transition count 613
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 6 with 30 rules applied. Total rules applied 456 place count 298 transition count 592
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 467 place count 298 transition count 581
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 495 place count 284 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 500 place count 284 transition count 584
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 8 with 69 rules applied. Total rules applied 569 place count 284 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 570 place count 283 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 570 place count 283 transition count 512
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 576 place count 280 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 578 place count 279 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 579 place count 279 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 581 place count 279 transition count 509
Applied a total of 581 rules in 67 ms. Remains 279 /579 variables (removed 300) and now considering 509/1136 (removed 627) transitions.
[2024-05-26 03:35:24] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
// Phase 1: matrix 501 rows 279 cols
[2024-05-26 03:35:24] [INFO ] Computed 58 invariants in 7 ms
[2024-05-26 03:35:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 03:35:24] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2024-05-26 03:35:24] [INFO ] Invariant cache hit.
[2024-05-26 03:35:24] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:35:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-26 03:35:24] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 03:35:24] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2024-05-26 03:35:24] [INFO ] Invariant cache hit.
[2024-05-26 03:35:24] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/579 places, 509/1136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 279/579 places, 509/1136 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0 (NOT p2) (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p4) p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s268 1) (EQ s276 1)), p1:(AND (EQ s268 1) (EQ s276 1)), p2:(EQ s106 1), p4:(AND (EQ s9 1) (EQ s23 1)), p3:(AND (EQ s237 1) (EQ s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 715 edges and 579 vertex of which 107 / 579 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.
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 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 37 place count 456 transition count 875
Ensure Unique test removed 2 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 454 transition count 875
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 54 place count 454 transition count 869
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 60 place count 450 transition count 867
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 354 place count 303 transition count 678
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 436 place count 303 transition count 596
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 466 place count 288 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 477 place count 288 transition count 564
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 505 place count 274 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 510 place count 274 transition count 567
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 581 place count 274 transition count 496
Applied a total of 581 rules in 93 ms. Remains 274 /579 variables (removed 305) and now considering 496/1136 (removed 640) transitions.
// Phase 1: matrix 496 rows 274 cols
[2024-05-26 03:35:25] [INFO ] Computed 55 invariants in 1 ms
[2024-05-26 03:35:25] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-26 03:35:25] [INFO ] Invariant cache hit.
[2024-05-26 03:35:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:25] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-26 03:35:25] [INFO ] Redundant transitions in 98 ms returned [386, 391, 398, 404, 406, 410, 414, 416, 417, 419, 420, 426, 428, 430, 435, 437, 438]
Found 17 redundant transitions using SMT.
Drop transitions removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions.
// Phase 1: matrix 479 rows 274 cols
[2024-05-26 03:35:25] [INFO ] Computed 55 invariants in 1 ms
[2024-05-26 03:35:25] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/579 places, 479/1136 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 4 place count 274 transition count 475
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 270 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 266 transition count 471
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 20 place count 264 transition count 471
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 264 transition count 469
Applied a total of 22 rules in 15 ms. Remains 264 /274 variables (removed 10) and now considering 469/479 (removed 10) transitions.
// Phase 1: matrix 469 rows 264 cols
[2024-05-26 03:35:25] [INFO ] Computed 55 invariants in 1 ms
[2024-05-26 03:35:26] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-26 03:35:26] [INFO ] Invariant cache hit.
[2024-05-26 03:35:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:26] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 264/579 places, 469/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1370 ms. Remains : 264/579 places, 469/1136 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s219 0) (EQ s227 0))], 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 1037 steps with 0 reset in 9 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 1422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 710 edges and 579 vertex of which 106 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 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 479 transition count 894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 466 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 456 transition count 878
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 453 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 57 place count 453 transition count 872
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 449 transition count 870
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 357 place count 302 transition count 681
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 438 place count 302 transition count 600
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 468 place count 287 transition count 579
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 479 place count 287 transition count 568
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 507 place count 273 transition count 576
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 512 place count 273 transition count 571
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 7 with 70 rules applied. Total rules applied 582 place count 273 transition count 501
Applied a total of 582 rules in 71 ms. Remains 273 /579 variables (removed 306) and now considering 501/1136 (removed 635) transitions.
// Phase 1: matrix 501 rows 273 cols
[2024-05-26 03:35:26] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:26] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-26 03:35:26] [INFO ] Invariant cache hit.
[2024-05-26 03:35:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:27] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-26 03:35:27] [INFO ] Redundant transitions in 100 ms returned [388, 394, 396, 397, 404, 410, 412, 416, 420, 422, 423, 425, 426, 434, 436, 440, 442, 443]
Found 18 redundant transitions using SMT.
Drop transitions removed 18 transitions
Redundant transitions reduction (with SMT) removed 18 transitions.
// Phase 1: matrix 483 rows 273 cols
[2024-05-26 03:35:27] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:27] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/579 places, 483/1136 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 273 transition count 478
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 268 transition count 478
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 264 transition count 474
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 22 place count 262 transition count 474
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 262 transition count 472
Applied a total of 24 rules in 22 ms. Remains 262 /273 variables (removed 11) and now considering 472/483 (removed 11) transitions.
// Phase 1: matrix 472 rows 262 cols
[2024-05-26 03:35:27] [INFO ] Computed 54 invariants in 1 ms
[2024-05-26 03:35:27] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-26 03:35:27] [INFO ] Invariant cache hit.
[2024-05-26 03:35:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:35:27] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/579 places, 472/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1257 ms. Remains : 262/579 places, 472/1136 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s100 0) (EQ s129 0)), p1:(EQ s257 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 1398 ms.
All properties solved by simple procedures.
Total runtime 20498 ms.

BK_STOP 1716694528755

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r263-tall-171654372700408"
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 ;