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-171654372800423.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-8B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 07:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 3.0M 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-8B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716695811936

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-8B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 03:56:53] [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:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:56:53] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2024-05-26 03:56:53] [INFO ] Transformed 9140 places.
[2024-05-26 03:56:54] [INFO ] Transformed 14577 transitions.
[2024-05-26 03:56:54] [INFO ] Found NUPN structural information;
[2024-05-26 03:56:54] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 9140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5500 places :
Symmetric choice reduction at 1 with 5500 rule applications. Total rules 5533 place count 3607 transition count 9077
Iterating global reduction 1 with 5500 rules applied. Total rules applied 11033 place count 3607 transition count 9077
Ensure Unique test removed 3050 transitions
Reduce isomorphic transitions removed 3050 transitions.
Iterating post reduction 1 with 3050 rules applied. Total rules applied 14083 place count 3607 transition count 6027
Discarding 2000 places :
Symmetric choice reduction at 2 with 2000 rule applications. Total rules 16083 place count 1607 transition count 4027
Iterating global reduction 2 with 2000 rules applied. Total rules applied 18083 place count 1607 transition count 4027
Ensure Unique test removed 1871 transitions
Reduce isomorphic transitions removed 1871 transitions.
Iterating post reduction 2 with 1871 rules applied. Total rules applied 19954 place count 1607 transition count 2156
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20020 place count 1541 transition count 2090
Iterating global reduction 3 with 66 rules applied. Total rules applied 20086 place count 1541 transition count 2090
Applied a total of 20086 rules in 1349 ms. Remains 1541 /9140 variables (removed 7599) and now considering 2090/14577 (removed 12487) transitions.
// Phase 1: matrix 2090 rows 1541 cols
[2024-05-26 03:56:55] [INFO ] Computed 66 invariants in 34 ms
[2024-05-26 03:56:56] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-26 03:56:56] [INFO ] Invariant cache hit.
[2024-05-26 03:56:57] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2024-05-26 03:56:57] [INFO ] Invariant cache hit.
[2024-05-26 03:56:58] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1541/9140 places, 2090/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4184 ms. Remains : 1541/9140 places, 2090/14577 transitions.
Support contains 29 out of 1541 places after structural reductions.
[2024-05-26 03:56:58] [INFO ] Flatten gal took : 147 ms
[2024-05-26 03:56:59] [INFO ] Flatten gal took : 86 ms
[2024-05-26 03:56:59] [INFO ] Input system was already deterministic with 2090 transitions.
Support contains 28 out of 1541 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-26 03:57:00] [INFO ] Invariant cache hit.
[2024-05-26 03:57:00] [INFO ] [Real]Absence check using 66 positive place invariants in 38 ms returned sat
[2024-05-26 03:57:00] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 03:57:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 38 ms returned sat
[2024-05-26 03:57:02] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-26 03:57:02] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 5 ms to minimize.
[2024-05-26 03:57:02] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 1 ms to minimize.
[2024-05-26 03:57:03] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 1 ms to minimize.
[2024-05-26 03:57:03] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 2 ms to minimize.
[2024-05-26 03:57:03] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 1 ms to minimize.
[2024-05-26 03:57:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1440 ms
[2024-05-26 03:57:04] [INFO ] After 3427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 469 ms.
[2024-05-26 03:57:05] [INFO ] After 4511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 164 ms.
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1342 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 7 ms
Free SCC test removed 453 places
Drop transitions removed 520 transitions
Reduce isomorphic transitions removed 520 transitions.
Graph (complete) has 2655 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 251 rules applied. Total rules applied 253 place count 1087 transition count 1319
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 224 rules applied. Total rules applied 477 place count 884 transition count 1298
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 20 rules applied. Total rules applied 497 place count 875 transition count 1287
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 502 place count 870 transition count 1287
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 502 place count 870 transition count 1190
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 696 place count 773 transition count 1190
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 792 place count 677 transition count 1002
Iterating global reduction 4 with 96 rules applied. Total rules applied 888 place count 677 transition count 1002
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 958 place count 677 transition count 932
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1406 place count 453 transition count 708
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1454 place count 453 transition count 660
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1460 place count 450 transition count 701
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 700
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1470 place count 450 transition count 691
Free-agglomeration rule applied 207 times.
Iterating global reduction 7 with 207 rules applied. Total rules applied 1677 place count 450 transition count 484
Reduce places removed 207 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 793 edges and 243 vertex of which 236 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 221 rules applied. Total rules applied 1898 place count 236 transition count 471
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1905 place count 236 transition count 464
Drop transitions removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 9 with 169 rules applied. Total rules applied 2074 place count 236 transition count 295
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 609 edges and 228 vertex of which 205 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2083 place count 205 transition count 295
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2106 place count 205 transition count 272
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 11 with 24 rules applied. Total rules applied 2130 place count 205 transition count 272
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2131 place count 205 transition count 271
Applied a total of 2131 rules in 311 ms. Remains 205 /1541 variables (removed 1336) and now considering 271/2090 (removed 1819) transitions.
// Phase 1: matrix 271 rows 205 cols
[2024-05-26 03:57:05] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 03:57:05] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 205/1541 places, 271/2090 transitions.
Finished random walk after 345 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3230 edges and 1541 vertex of which 1540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.45 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||G(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 5 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 1086 transition count 1349
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 229 rules applied. Total rules applied 484 place count 881 transition count 1325
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 21 rules applied. Total rules applied 505 place count 871 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 510 place count 866 transition count 1314
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 510 place count 866 transition count 1218
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 702 place count 770 transition count 1218
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 798 place count 674 transition count 1030
Iterating global reduction 4 with 96 rules applied. Total rules applied 894 place count 674 transition count 1030
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 964 place count 674 transition count 960
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1464 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1497 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1545 place count 415 transition count 637
Applied a total of 1545 rules in 182 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 03:57:06] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 03:57:06] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:57:06] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-26 03:57:06] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:06] [INFO ] Invariant cache hit.
[2024-05-26 03:57:06] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:57:06] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-26 03:57:06] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-26 03:57:06] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:06] [INFO ] Invariant cache hit.
[2024-05-26 03:57:07] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1027 ms. Remains : 415/1541 places, 637/2090 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 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s399 1), p0:(EQ s200 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 1272 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(p0)||G(F(p1))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1344 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 5 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 1086 transition count 1350
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 226 rules applied. Total rules applied 480 place count 882 transition count 1328
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 18 rules applied. Total rules applied 498 place count 873 transition count 1319
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 502 place count 869 transition count 1319
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 502 place count 869 transition count 1222
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 696 place count 772 transition count 1222
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 792 place count 676 transition count 1034
Iterating global reduction 4 with 96 rules applied. Total rules applied 888 place count 676 transition count 1034
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 958 place count 676 transition count 964
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1406 place count 452 transition count 740
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1454 place count 452 transition count 692
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1456 place count 452 transition count 690
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1458 place count 452 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1460 place count 450 transition count 688
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1493 place count 441 transition count 664
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1541 place count 417 transition count 640
Applied a total of 1541 rules in 147 ms. Remains 417 /1541 variables (removed 1124) and now considering 640/2090 (removed 1450) transitions.
[2024-05-26 03:57:07] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 417 cols
[2024-05-26 03:57:07] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:57:07] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-26 03:57:07] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2024-05-26 03:57:07] [INFO ] Invariant cache hit.
[2024-05-26 03:57:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:57:08] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-26 03:57:08] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-26 03:57:08] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2024-05-26 03:57:08] [INFO ] Invariant cache hit.
[2024-05-26 03:57:08] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1541 places, 640/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 932 ms. Remains : 417/1541 places, 640/2090 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s57 0) (EQ s152 0)), p1:(EQ s226 0)], 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 292 steps with 1 reset in 10 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-01 finished in 1079 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(p0) U (p1||G(!p0))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 2072
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 2072
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 1523 transition count 2056
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 1513 transition count 2046
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 1513 transition count 2046
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 82 place count 1513 transition count 2036
Applied a total of 82 rules in 114 ms. Remains 1513 /1541 variables (removed 28) and now considering 2036/2090 (removed 54) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2024-05-26 03:57:08] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 03:57:08] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-26 03:57:08] [INFO ] Invariant cache hit.
[2024-05-26 03:57:10] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
[2024-05-26 03:57:10] [INFO ] Invariant cache hit.
[2024-05-26 03:57:11] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1541 places, 2036/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2552 ms. Remains : 1513/1541 places, 2036/2090 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s1002 1), p1:(EQ s1271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2407 steps with 1 reset in 15 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 2788 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)&&(G(p1)||(p1&&F(!p0)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 1 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1086 transition count 1348
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 229 rules applied. Total rules applied 485 place count 880 transition count 1325
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 21 rules applied. Total rules applied 506 place count 871 transition count 1313
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 865 transition count 1313
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 512 place count 865 transition count 1217
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 704 place count 769 transition count 1217
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 800 place count 673 transition count 1029
Iterating global reduction 4 with 96 rules applied. Total rules applied 896 place count 673 transition count 1029
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 966 place count 673 transition count 959
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1465 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1498 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1546 place count 415 transition count 637
Applied a total of 1546 rules in 145 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 03:57:11] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 03:57:11] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:57:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-26 03:57:11] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:11] [INFO ] Invariant cache hit.
[2024-05-26 03:57:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:57:11] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-26 03:57:11] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 03:57:11] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:11] [INFO ] Invariant cache hit.
[2024-05-26 03:57:12] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 949 ms. Remains : 415/1541 places, 637/2090 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, p0, (NOT p0), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s200 1), p1:(NEQ s321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 1161 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)||X(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 118 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 03:57:12] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 03:57:12] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-26 03:57:12] [INFO ] Invariant cache hit.
[2024-05-26 03:57:14] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2024-05-26 03:57:14] [INFO ] Invariant cache hit.
[2024-05-26 03:57:15] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2617 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(EQ s369 1), p0:(EQ s1504 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 2891 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))))'
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2070
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2070
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 58 place count 1521 transition count 2052
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 1510 transition count 2041
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 1510 transition count 2041
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 91 place count 1510 transition count 2030
Applied a total of 91 rules in 111 ms. Remains 1510 /1541 variables (removed 31) and now considering 2030/2090 (removed 60) transitions.
// Phase 1: matrix 2030 rows 1510 cols
[2024-05-26 03:57:15] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 03:57:15] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-26 03:57:15] [INFO ] Invariant cache hit.
[2024-05-26 03:57:17] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2024-05-26 03:57:17] [INFO ] Invariant cache hit.
[2024-05-26 03:57:17] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1541 places, 2030/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2590 ms. Remains : 1510/1541 places, 2030/2090 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s965 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10072 steps with 3 reset in 46 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-06 finished in 2788 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(F((p0&&G(p1))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 114 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 03:57:18] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 03:57:18] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-26 03:57:18] [INFO ] Invariant cache hit.
[2024-05-26 03:57:19] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2024-05-26 03:57:19] [INFO ] Invariant cache hit.
[2024-05-26 03:57:20] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2527 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1433 1), p1:(EQ s1204 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]]
Stuttering criterion allowed to conclude after 2986 steps with 0 reset in 21 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-09 finished in 2734 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(F((p0||(p1&&G(F(p2))))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 105 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 03:57:20] [INFO ] Computed 66 invariants in 21 ms
[2024-05-26 03:57:21] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-26 03:57:21] [INFO ] Invariant cache hit.
[2024-05-26 03:57:22] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-05-26 03:57:22] [INFO ] Invariant cache hit.
[2024-05-26 03:57:23] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2589 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s966 0), p1:(EQ s759 1), p2:(EQ s1133 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]]
Product exploration explored 100000 steps with 33333 reset in 721 ms.
Product exploration explored 100000 steps with 33333 reset in 692 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3172 edges and 1511 vertex of which 1510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 4375 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&&X(F(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 128 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 03:57:25] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 03:57:25] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-26 03:57:25] [INFO ] Invariant cache hit.
[2024-05-26 03:57:26] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2024-05-26 03:57:26] [INFO ] Invariant cache hit.
[2024-05-26 03:57:27] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2519 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s116 1), p1:(EQ s1040 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7723 steps with 5 reset in 28 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-11 finished in 2653 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((p0||X(p1)||(F(p0)&&(p2 U p3)))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 2073
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 2073
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 49 place count 1524 transition count 2058
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 1515 transition count 2049
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 1515 transition count 2049
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 1515 transition count 2040
Applied a total of 76 rules in 107 ms. Remains 1515 /1541 variables (removed 26) and now considering 2040/2090 (removed 50) transitions.
// Phase 1: matrix 2040 rows 1515 cols
[2024-05-26 03:57:27] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 03:57:28] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-26 03:57:28] [INFO ] Invariant cache hit.
[2024-05-26 03:57:29] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-05-26 03:57:29] [INFO ] Invariant cache hit.
[2024-05-26 03:57:30] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1515/1541 places, 2040/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 1515/1541 places, 2040/2090 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), true, (NOT p0), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s835 1), p3:(NEQ s1435 1), p2:(EQ s680 1), p1:(EQ s497 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1379 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-12 finished in 2979 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||X(F((F(p2)&&F(p3)&&p1))))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 2072
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 2072
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 1523 transition count 2056
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 1512 transition count 2045
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 1512 transition count 2045
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 1512 transition count 2034
Applied a total of 85 rules in 107 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2090 (removed 56) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2024-05-26 03:57:30] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:57:31] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-26 03:57:31] [INFO ] Invariant cache hit.
[2024-05-26 03:57:32] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2024-05-26 03:57:32] [INFO ] Invariant cache hit.
[2024-05-26 03:57:33] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1541 places, 2034/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2512 ms. Remains : 1512/1541 places, 2034/2090 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s375 1) (EQ s483 1)), p1:(AND (EQ s375 1) (EQ s483 1)), p2:(EQ s833 1), p3:(EQ s1003 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 2534 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-13 finished in 2745 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)))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 472 / 1541 are part of one of the 33 SCC in 1 ms
Free SCC test removed 439 places
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Graph (complete) has 2714 edges and 1102 vertex of which 1101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 1100 transition count 1357
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 1 with 242 rules applied. Total rules applied 507 place count 885 transition count 1330
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 25 rules applied. Total rules applied 532 place count 874 transition count 1316
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 539 place count 867 transition count 1316
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 539 place count 867 transition count 1221
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 729 place count 772 transition count 1221
Discarding 92 places :
Symmetric choice reduction at 4 with 92 rule applications. Total rules 821 place count 680 transition count 1041
Iterating global reduction 4 with 92 rules applied. Total rules applied 913 place count 680 transition count 1041
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 4 with 66 rules applied. Total rules applied 979 place count 680 transition count 975
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Deduced a syphon composed of 227 places in 0 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 5 with 454 rules applied. Total rules applied 1433 place count 453 transition count 748
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1483 place count 453 transition count 698
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1485 place count 451 transition count 696
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1518 place count 442 transition count 672
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1566 place count 418 transition count 648
Applied a total of 1566 rules in 91 ms. Remains 418 /1541 variables (removed 1123) and now considering 648/2090 (removed 1442) transitions.
[2024-05-26 03:57:33] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
// Phase 1: matrix 616 rows 418 cols
[2024-05-26 03:57:33] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:57:33] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 03:57:33] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2024-05-26 03:57:33] [INFO ] Invariant cache hit.
[2024-05-26 03:57:34] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:57:34] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-26 03:57:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 03:57:34] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2024-05-26 03:57:34] [INFO ] Invariant cache hit.
[2024-05-26 03:57:34] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1541 places, 648/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 935 ms. Remains : 418/1541 places, 648/2090 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s245 1) (EQ s383 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-14 finished in 1022 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)||G(p1))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 1 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1086 transition count 1348
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 229 rules applied. Total rules applied 485 place count 880 transition count 1325
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 21 rules applied. Total rules applied 506 place count 871 transition count 1313
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 865 transition count 1313
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 512 place count 865 transition count 1217
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 704 place count 769 transition count 1217
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 800 place count 673 transition count 1029
Iterating global reduction 4 with 96 rules applied. Total rules applied 896 place count 673 transition count 1029
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 966 place count 673 transition count 959
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1465 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1498 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1546 place count 415 transition count 637
Applied a total of 1546 rules in 101 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 03:57:34] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 03:57:34] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:57:34] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-26 03:57:34] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:34] [INFO ] Invariant cache hit.
[2024-05-26 03:57:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 03:57:35] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-26 03:57:35] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 03:57:35] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 03:57:35] [INFO ] Invariant cache hit.
[2024-05-26 03:57:35] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 415/1541 places, 637/2090 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s374 1), p1:(EQ s57 1)], nbAcceptance=2, 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 979 ms.
All properties solved by simple procedures.
Total runtime 42095 ms.

BK_STOP 1716695856557

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-8B"
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-8B, 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-171654372800423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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