Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539900316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is NoC3x3-PT-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539900316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 552K Mar 5 18:23 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-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678943913294

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 05:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 05:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:18:36] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-16 05:18:36] [INFO ] Transformed 1544 places.
[2023-03-16 05:18:36] [INFO ] Transformed 2229 transitions.
[2023-03-16 05:18:36] [INFO ] Found NUPN structural information;
[2023-03-16 05:18:36] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 407 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 2 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 362 places :
Symmetric choice reduction at 0 with 362 rule applications. Total rules 362 place count 1182 transition count 1867
Iterating global reduction 0 with 362 rules applied. Total rules applied 724 place count 1182 transition count 1867
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 833 place count 1073 transition count 1658
Iterating global reduction 0 with 109 rules applied. Total rules applied 942 place count 1073 transition count 1658
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 1028 place count 987 transition count 1522
Iterating global reduction 0 with 86 rules applied. Total rules applied 1114 place count 987 transition count 1522
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1134 place count 967 transition count 1482
Iterating global reduction 0 with 20 rules applied. Total rules applied 1154 place count 967 transition count 1482
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1456
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1456
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1193 place count 941 transition count 1443
Iterating global reduction 0 with 13 rules applied. Total rules applied 1206 place count 941 transition count 1443
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1209 place count 938 transition count 1437
Iterating global reduction 0 with 3 rules applied. Total rules applied 1212 place count 938 transition count 1437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1215 place count 935 transition count 1431
Iterating global reduction 0 with 3 rules applied. Total rules applied 1218 place count 935 transition count 1431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1221 place count 932 transition count 1428
Iterating global reduction 0 with 3 rules applied. Total rules applied 1224 place count 932 transition count 1428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1230 place count 932 transition count 1422
Applied a total of 1230 rules in 790 ms. Remains 932 /1544 variables (removed 612) and now considering 1422/2229 (removed 807) transitions.
// Phase 1: matrix 1422 rows 932 cols
[2023-03-16 05:18:37] [INFO ] Computed 66 place invariants in 44 ms
[2023-03-16 05:18:38] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2023-03-16 05:18:38] [INFO ] Invariant cache hit.
[2023-03-16 05:18:40] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2023-03-16 05:18:40] [INFO ] Invariant cache hit.
[2023-03-16 05:18:41] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 932/1544 places, 1422/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4982 ms. Remains : 932/1544 places, 1422/2229 transitions.
Support contains 50 out of 932 places after structural reductions.
[2023-03-16 05:18:42] [INFO ] Flatten gal took : 210 ms
[2023-03-16 05:18:42] [INFO ] Flatten gal took : 112 ms
[2023-03-16 05:18:42] [INFO ] Input system was already deterministic with 1422 transitions.
Support contains 48 out of 932 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 29) seen :22
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 05:18:43] [INFO ] Invariant cache hit.
[2023-03-16 05:18:44] [INFO ] [Real]Absence check using 66 positive place invariants in 103 ms returned sat
[2023-03-16 05:18:44] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 05:18:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 87 ms returned sat
[2023-03-16 05:18:46] [INFO ] After 1118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-16 05:18:46] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 6 ms to minimize.
[2023-03-16 05:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-16 05:18:46] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 2 ms to minimize.
[2023-03-16 05:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-16 05:18:47] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2023-03-16 05:18:47] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2023-03-16 05:18:47] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 0 ms to minimize.
[2023-03-16 05:18:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 660 ms
[2023-03-16 05:18:48] [INFO ] Deduced a trap composed of 106 places in 226 ms of which 1 ms to minimize.
[2023-03-16 05:18:48] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2023-03-16 05:18:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-16 05:18:48] [INFO ] After 3492ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-16 05:18:48] [INFO ] After 4407ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 83 ms.
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 932 transition count 1389
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 899 transition count 1389
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 66 place count 899 transition count 1293
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 258 place count 803 transition count 1293
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 290 place count 771 transition count 1138
Iterating global reduction 2 with 32 rules applied. Total rules applied 322 place count 771 transition count 1138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 329 place count 764 transition count 1117
Iterating global reduction 2 with 7 rules applied. Total rules applied 336 place count 764 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 763 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 763 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 762 transition count 1113
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 762 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 341 place count 762 transition count 1112
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 699 place count 583 transition count 933
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 901 place count 482 transition count 965
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 979 place count 443 transition count 981
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 1002 place count 443 transition count 958
Free-agglomeration rule applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 1027 place count 443 transition count 933
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1066 place count 418 transition count 919
Applied a total of 1066 rules in 552 ms. Remains 418 /932 variables (removed 514) and now considering 919/1422 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 418/932 places, 919/1422 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 919 rows 418 cols
[2023-03-16 05:18:49] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-16 05:18:49] [INFO ] [Real]Absence check using 66 positive place invariants in 20 ms returned sat
[2023-03-16 05:18:50] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:18:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-16 05:18:50] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:18:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 05:18:50] [INFO ] After 56ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:18:50] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 05:18:50] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 919/919 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 418 transition count 917
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 416 transition count 917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 415 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 415 transition count 913
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 414 transition count 915
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 414 transition count 909
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 412 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 412 transition count 895
Applied a total of 18 rules in 87 ms. Remains 412 /418 variables (removed 6) and now considering 895/919 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 412/418 places, 895/919 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265936 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265936 steps, saw 76499 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 412 cols
[2023-03-16 05:18:54] [INFO ] Computed 66 place invariants in 10 ms
[2023-03-16 05:18:54] [INFO ] [Real]Absence check using 66 positive place invariants in 23 ms returned sat
[2023-03-16 05:18:54] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:18:54] [INFO ] [Nat]Absence check using 66 positive place invariants in 21 ms returned sat
[2023-03-16 05:18:54] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:18:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 05:18:55] [INFO ] After 49ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:18:55] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-16 05:18:55] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 19 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 412/412 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-16 05:18:55] [INFO ] Invariant cache hit.
[2023-03-16 05:18:55] [INFO ] Implicit Places using invariants in 385 ms returned [10, 45, 89, 128, 184, 256, 302, 343, 392]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 389 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/412 places, 895/895 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 379 transition count 871
Applied a total of 48 rules in 28 ms. Remains 379 /403 variables (removed 24) and now considering 871/895 (removed 24) transitions.
// Phase 1: matrix 871 rows 379 cols
[2023-03-16 05:18:55] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 05:18:55] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-16 05:18:55] [INFO ] Invariant cache hit.
[2023-03-16 05:18:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-16 05:18:56] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/412 places, 871/895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1682 ms. Remains : 379/412 places, 871/895 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 256787 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256787 steps, saw 70507 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:18:59] [INFO ] Invariant cache hit.
[2023-03-16 05:19:00] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 05:19:00] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 05:19:00] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-16 05:19:00] [INFO ] After 91ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:00] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 05:19:00] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 871/871 transitions.
Applied a total of 0 rules in 21 ms. Remains 379 /379 variables (removed 0) and now considering 871/871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 379/379 places, 871/871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 871/871 transitions.
Applied a total of 0 rules in 16 ms. Remains 379 /379 variables (removed 0) and now considering 871/871 (removed 0) transitions.
[2023-03-16 05:19:00] [INFO ] Invariant cache hit.
[2023-03-16 05:19:01] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-16 05:19:01] [INFO ] Invariant cache hit.
[2023-03-16 05:19:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-16 05:19:02] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-16 05:19:02] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-16 05:19:02] [INFO ] Invariant cache hit.
[2023-03-16 05:19:03] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2276 ms. Remains : 379/379 places, 871/871 transitions.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 379 transition count 857
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 379 transition count 857
Applied a total of 18 rules in 46 ms. Remains 379 /379 variables (removed 0) and now considering 857/871 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 857 rows 379 cols
[2023-03-16 05:19:03] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 05:19:03] [INFO ] [Real]Absence check using 57 positive place invariants in 76 ms returned sat
[2023-03-16 05:19:03] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 34 ms returned sat
[2023-03-16 05:19:04] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:04] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-16 05:19:04] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 146 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-16 05:19:05] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-16 05:19:05] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-16 05:19:05] [INFO ] Invariant cache hit.
[2023-03-16 05:19:07] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
[2023-03-16 05:19:07] [INFO ] Invariant cache hit.
[2023-03-16 05:19:08] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3830 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00 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:(EQ s274 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 2 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 4291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||(p2 U (p3||G(p2))))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 154 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-16 05:19:09] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-16 05:19:10] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-16 05:19:10] [INFO ] Invariant cache hit.
[2023-03-16 05:19:11] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2386 ms to find 0 implicit places.
[2023-03-16 05:19:11] [INFO ] Invariant cache hit.
[2023-03-16 05:19:13] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4202 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 367 ms :[true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(OR (AND (EQ s436 1) (EQ s460 1)) (AND (EQ s679 1) (EQ s713 1))), p3:(AND (NEQ s671 1) (NEQ s0 1)), p2:(NEQ s0 1), p1:(AND (EQ s436 1) (EQ s460 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1078 ms.
Product exploration explored 100000 steps with 50000 reset in 919 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/900 stabilizing places and 65/1351 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p3) (NOT p2))))
Knowledge based reduction with 15 factoid took 369 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 7007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&F(G(p1))) U p2))))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 921 transition count 1397
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 921 transition count 1397
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 913 transition count 1382
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 913 transition count 1382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 909 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 909 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1364
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1358
Applied a total of 59 rules in 158 ms. Remains 904 /932 variables (removed 28) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2023-03-16 05:19:16] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 05:19:17] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-16 05:19:17] [INFO ] Invariant cache hit.
[2023-03-16 05:19:18] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2023-03-16 05:19:18] [INFO ] Invariant cache hit.
[2023-03-16 05:19:19] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3672 ms. Remains : 904/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s143 1) (EQ s168 1)), p0:(EQ s214 1), p1:(EQ s538 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 3897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1091
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1091
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1082
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1080
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1079
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 5 with 354 rules applied. Total rules applied 713 place count 575 transition count 902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 915 place count 474 transition count 932
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 993 place count 435 transition count 947
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1017 place count 435 transition count 923
Applied a total of 1017 rules in 302 ms. Remains 435 /932 variables (removed 497) and now considering 923/1422 (removed 499) transitions.
// Phase 1: matrix 923 rows 435 cols
[2023-03-16 05:19:20] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-16 05:19:20] [INFO ] Implicit Places using invariants in 374 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 377 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/932 places, 923/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 899
Applied a total of 48 rules in 29 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-16 05:19:20] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-16 05:19:21] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-16 05:19:21] [INFO ] Invariant cache hit.
[2023-03-16 05:19:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:22] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/932 places, 899/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2058 ms. Remains : 402/932 places, 899/1422 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s131 0)), p1:(EQ s203 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 691 reset in 633 ms.
Product exploration explored 100000 steps with 696 reset in 652 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:19:23] [INFO ] Invariant cache hit.
[2023-03-16 05:19:23] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:24] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 05:19:24] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:24] [INFO ] After 84ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:24] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 05:19:24] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 33 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232813 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232813 steps, saw 64878 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2023-03-16 05:19:27] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-16 05:19:27] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 05:19:28] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:28] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:28] [INFO ] After 76ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:28] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 05:19:28] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 12 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 11 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-16 05:19:28] [INFO ] Invariant cache hit.
[2023-03-16 05:19:28] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-16 05:19:28] [INFO ] Invariant cache hit.
[2023-03-16 05:19:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:30] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2023-03-16 05:19:30] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 05:19:30] [INFO ] Invariant cache hit.
[2023-03-16 05:19:30] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2250 ms. Remains : 377/377 places, 860/860 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 32 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2023-03-16 05:19:30] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:19:30] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:30] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 05:19:31] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:31] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 05:19:31] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-16 05:19:31] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:19:32] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-16 05:19:32] [INFO ] Invariant cache hit.
[2023-03-16 05:19:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:33] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2023-03-16 05:19:33] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 05:19:33] [INFO ] Invariant cache hit.
[2023-03-16 05:19:33] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1949 ms. Remains : 402/402 places, 899/899 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:19:34] [INFO ] Invariant cache hit.
[2023-03-16 05:19:34] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:19:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 05:19:34] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:34] [INFO ] After 84ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:19:34] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-16 05:19:34] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 26 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished Best-First random walk after 2102 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=525 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 691 reset in 456 ms.
Product exploration explored 100000 steps with 695 reset in 505 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2023-03-16 05:19:36] [INFO ] Invariant cache hit.
[2023-03-16 05:19:36] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-16 05:19:36] [INFO ] Invariant cache hit.
[2023-03-16 05:19:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:37] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2023-03-16 05:19:37] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 05:19:37] [INFO ] Invariant cache hit.
[2023-03-16 05:19:38] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2291 ms. Remains : 402/402 places, 899/899 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 18734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 5 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 910 transition count 1377
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 910 transition count 1377
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 906 transition count 1363
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 906 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 903 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 157 ms. Remains 901 /932 variables (removed 31) and now considering 1353/1422 (removed 69) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2023-03-16 05:19:38] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 05:19:39] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-16 05:19:39] [INFO ] Invariant cache hit.
[2023-03-16 05:19:41] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2023-03-16 05:19:41] [INFO ] Invariant cache hit.
[2023-03-16 05:19:42] [INFO ] Dead Transitions using invariants and state equation in 1491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/932 places, 1353/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3729 ms. Remains : 901/932 places, 1353/1422 transitions.
Stuttering acceptance computed with spot in 348 ms :[true, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), p2, (NOT p1), (AND p0 p2), (AND p2 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 8}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (EQ s136 1) (EQ s224 1)), p1:(NEQ s372 1), p2:(AND (EQ s83 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 228 reset in 419 ms.
Entered a terminal (fully accepting) state of product in 26401 steps with 57 reset in 130 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 4655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1398
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1398
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1383
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 908 transition count 1375
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 906 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 906 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1370
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1369
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1366
Applied a total of 59 rules in 143 ms. Remains 904 /932 variables (removed 28) and now considering 1366/1422 (removed 56) transitions.
// Phase 1: matrix 1366 rows 904 cols
[2023-03-16 05:19:43] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 05:19:44] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-16 05:19:44] [INFO ] Invariant cache hit.
[2023-03-16 05:19:45] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2023-03-16 05:19:45] [INFO ] Invariant cache hit.
[2023-03-16 05:19:47] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1366/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3722 ms. Remains : 904/932 places, 1366/1422 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s755 1) (EQ s819 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 344 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 3827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 764 transition count 1112
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 764 transition count 1112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 342 place count 756 transition count 1096
Iterating global reduction 2 with 8 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 transition count 1084
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 5 with 354 rules applied. Total rules applied 715 place count 574 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 939
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 954
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1021 place count 434 transition count 928
Applied a total of 1021 rules in 220 ms. Remains 434 /932 variables (removed 498) and now considering 928/1422 (removed 494) transitions.
[2023-03-16 05:19:47] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 434 cols
[2023-03-16 05:19:47] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-16 05:19:47] [INFO ] Implicit Places using invariants in 497 ms returned [10, 47, 95, 134, 194, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 498 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 928/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 904
Applied a total of 48 rules in 21 ms. Remains 401 /425 variables (removed 24) and now considering 904/928 (removed 24) transitions.
[2023-03-16 05:19:48] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
// Phase 1: matrix 900 rows 401 cols
[2023-03-16 05:19:48] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-16 05:19:48] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-16 05:19:48] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
[2023-03-16 05:19:48] [INFO ] Invariant cache hit.
[2023-03-16 05:19:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-16 05:19:49] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 904/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2204 ms. Remains : 401/932 places, 904/1422 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-08 finished in 2260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1121
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 341 place count 756 transition count 1096
Iterating global reduction 2 with 9 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 711 place count 576 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 913 place count 475 transition count 941
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 989 place count 437 transition count 953
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1013 place count 437 transition count 929
Applied a total of 1013 rules in 194 ms. Remains 437 /932 variables (removed 495) and now considering 929/1422 (removed 493) transitions.
// Phase 1: matrix 929 rows 437 cols
[2023-03-16 05:19:49] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-16 05:19:50] [INFO ] Implicit Places using invariants in 520 ms returned [11, 48, 96, 135, 276, 326, 365, 414]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 523 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/932 places, 929/1422 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 409 transition count 909
Applied a total of 40 rules in 19 ms. Remains 409 /429 variables (removed 20) and now considering 909/929 (removed 20) transitions.
// Phase 1: matrix 909 rows 409 cols
[2023-03-16 05:19:50] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-16 05:19:50] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-16 05:19:50] [INFO ] Invariant cache hit.
[2023-03-16 05:19:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:19:51] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 409/932 places, 909/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2309 ms. Remains : 409/932 places, 909/1422 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s381 1) (EQ s395 1)), p1:(AND (EQ s32 1) (EQ s182 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][true, true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 2403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1367
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 904 transition count 1364
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 904 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 139 ms. Remains 902 /932 variables (removed 30) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2023-03-16 05:19:52] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 05:19:52] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-16 05:19:52] [INFO ] Invariant cache hit.
[2023-03-16 05:19:53] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-16 05:19:53] [INFO ] Invariant cache hit.
[2023-03-16 05:19:55] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3401 ms. Remains : 902/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s400 1) (EQ s558 1)), p0:(AND (EQ s847 1) (EQ s897 1) (NOT (AND (EQ s761 1) (EQ s821 1)))), p2:(AND (EQ s761 1) (EQ s821 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 242 reset in 387 ms.
Product exploration explored 100000 steps with 245 reset in 547 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 510 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:19:57] [INFO ] Invariant cache hit.
[2023-03-16 05:19:57] [INFO ] [Real]Absence check using 66 positive place invariants in 46 ms returned sat
[2023-03-16 05:19:58] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 05:19:58] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-16 05:19:59] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 05:19:59] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-16 05:19:59] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 902 transition count 1330
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 874 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 874 transition count 1235
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 779 transition count 1235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 756 transition count 1087
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 756 transition count 1087
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 652 place count 576 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 475 transition count 937
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 932 place count 436 transition count 957
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 958 place count 436 transition count 931
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 982 place count 436 transition count 907
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1018 place count 412 transition count 895
Applied a total of 1018 rules in 136 ms. Remains 412 /902 variables (removed 490) and now considering 895/1358 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 412/902 places, 895/1358 transitions.
Finished random walk after 381 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=127 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 622 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 112 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 901 transition count 1329
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 873 transition count 1329
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 873 transition count 1234
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 778 transition count 1234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 755 transition count 1086
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 755 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 646 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 439 transition count 959
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 950 place count 439 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 951 place count 438 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 437 transition count 932
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 956 place count 435 transition count 930
Applied a total of 956 rules in 146 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2023-03-16 05:20:00] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-16 05:20:01] [INFO ] Implicit Places using invariants in 509 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 511 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/902 places, 930/1358 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 908
Applied a total of 44 rules in 20 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-16 05:20:01] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-16 05:20:01] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-16 05:20:01] [INFO ] Invariant cache hit.
[2023-03-16 05:20:01] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-16 05:20:02] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/902 places, 908/1358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2070 ms. Remains : 405/902 places, 908/1358 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 1105 steps, including 8 resets, run visited all 3 properties in 8 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 683 reset in 460 ms.
Product exploration explored 100000 steps with 681 reset in 501 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-16 05:20:04] [INFO ] Invariant cache hit.
[2023-03-16 05:20:05] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-16 05:20:05] [INFO ] Invariant cache hit.
[2023-03-16 05:20:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-16 05:20:06] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-16 05:20:06] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 05:20:06] [INFO ] Invariant cache hit.
[2023-03-16 05:20:06] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2232 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 14919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 920 transition count 1399
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 920 transition count 1399
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 913 transition count 1386
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 913 transition count 1386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 910 transition count 1378
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 910 transition count 1378
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 908 transition count 1375
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 907 transition count 1373
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 907 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 906 transition count 1372
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 906 transition count 1372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 906 transition count 1369
Applied a total of 55 rules in 148 ms. Remains 906 /932 variables (removed 26) and now considering 1369/1422 (removed 53) transitions.
// Phase 1: matrix 1369 rows 906 cols
[2023-03-16 05:20:07] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 05:20:07] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-16 05:20:07] [INFO ] Invariant cache hit.
[2023-03-16 05:20:09] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2023-03-16 05:20:09] [INFO ] Invariant cache hit.
[2023-03-16 05:20:10] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 906/932 places, 1369/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4047 ms. Remains : 906/932 places, 1369/1422 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s536 1), p0:(AND (EQ s306 1) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-11 finished in 4200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 176 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-16 05:20:11] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-16 05:20:12] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-16 05:20:12] [INFO ] Invariant cache hit.
[2023-03-16 05:20:13] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2023-03-16 05:20:13] [INFO ] Invariant cache hit.
[2023-03-16 05:20:15] [INFO ] Dead Transitions using invariants and state equation in 1678 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4261 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s350 1)), p0:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 225 reset in 308 ms.
Product exploration explored 100000 steps with 224 reset in 338 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:20:16] [INFO ] Invariant cache hit.
[2023-03-16 05:20:17] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:20:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 43 ms returned sat
[2023-03-16 05:20:18] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:20:18] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-16 05:20:18] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 650 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 134 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 9491 steps, including 63 resets, run visited all 2 properties in 183 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 18 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2023-03-16 05:20:19] [INFO ] Invariant cache hit.
[2023-03-16 05:20:20] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-16 05:20:20] [INFO ] Invariant cache hit.
[2023-03-16 05:20:21] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
[2023-03-16 05:20:21] [INFO ] Invariant cache hit.
[2023-03-16 05:20:23] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3840 ms. Remains : 902/902 places, 1354/1354 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 2195 steps, including 4 resets, run visited all 3 properties in 47 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 226 reset in 300 ms.
Product exploration explored 100000 steps with 232 reset in 337 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1354
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 27 place count 902 transition count 1406
Deduced a syphon composed of 79 places in 4 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 79 place count 902 transition count 1406
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 301 place count 902 transition count 1406
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 382 place count 821 transition count 1199
Deduced a syphon composed of 244 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 463 place count 821 transition count 1199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 487 place count 797 transition count 1175
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 511 place count 797 transition count 1175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -308
Deduced a syphon composed of 321 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 797 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 613 place count 796 transition count 1481
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 614 place count 796 transition count 1481
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 652 place count 796 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 653 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 654 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 678 place count 795 transition count 1568
Deduced a syphon composed of 357 places in 0 ms
Applied a total of 678 rules in 351 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2023-03-16 05:20:26] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1568 rows 795 cols
[2023-03-16 05:20:26] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-16 05:20:27] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 795/902 places, 1568/1354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1888 ms. Remains : 795/902 places, 1568/1354 transitions.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 24 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-16 05:20:27] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-16 05:20:28] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-16 05:20:28] [INFO ] Invariant cache hit.
[2023-03-16 05:20:29] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-16 05:20:29] [INFO ] Invariant cache hit.
[2023-03-16 05:20:31] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3587 ms. Remains : 902/902 places, 1354/1354 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 20110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 5 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 300 place count 763 transition count 1111
Iterating global reduction 2 with 36 rules applied. Total rules applied 336 place count 763 transition count 1111
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 345 place count 754 transition count 1086
Iterating global reduction 2 with 9 rules applied. Total rules applied 354 place count 754 transition count 1086
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 754 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 359 place count 750 transition count 1077
Iterating global reduction 4 with 3 rules applied. Total rules applied 362 place count 750 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 363 place count 749 transition count 1075
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 749 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 749 transition count 1074
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 715 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 941
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1019 place count 434 transition count 917
Applied a total of 1019 rules in 296 ms. Remains 434 /932 variables (removed 498) and now considering 917/1422 (removed 505) transitions.
// Phase 1: matrix 917 rows 434 cols
[2023-03-16 05:20:31] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-16 05:20:31] [INFO ] Implicit Places using invariants in 479 ms returned [11, 46, 94, 133, 193, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 491 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 917/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 893
Applied a total of 48 rules in 21 ms. Remains 401 /425 variables (removed 24) and now considering 893/917 (removed 24) transitions.
// Phase 1: matrix 893 rows 401 cols
[2023-03-16 05:20:31] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:20:32] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-16 05:20:32] [INFO ] Invariant cache hit.
[2023-03-16 05:20:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:20:33] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 893/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2209 ms. Remains : 401/932 places, 893/1422 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 2269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((G(p1)&&p0))))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 146 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-16 05:20:33] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-16 05:20:34] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-16 05:20:34] [INFO ] Invariant cache hit.
[2023-03-16 05:20:35] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2023-03-16 05:20:35] [INFO ] Invariant cache hit.
[2023-03-16 05:20:37] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3956 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (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-6B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s429 1) (EQ s458 1)), p1:(NEQ s843 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 316 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-14 finished in 4251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Found a Shortening insensitive property : NoC3x3-PT-6B-LTLFireability-10
Stuttering acceptance computed with spot in 160 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 66 place count 898 transition count 1291
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 260 place count 801 transition count 1291
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 295 place count 766 transition count 1118
Iterating global reduction 2 with 35 rules applied. Total rules applied 330 place count 766 transition count 1118
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 757 transition count 1093
Iterating global reduction 2 with 9 rules applied. Total rules applied 348 place count 757 transition count 1093
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 352 place count 754 transition count 1087
Iterating global reduction 4 with 2 rules applied. Total rules applied 354 place count 754 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 355 place count 753 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 753 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 707 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 909 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 985 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 986 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 987 place count 437 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 991 place count 435 transition count 956
Applied a total of 991 rules in 200 ms. Remains 435 /932 variables (removed 497) and now considering 956/1422 (removed 466) transitions.
// Phase 1: matrix 956 rows 435 cols
[2023-03-16 05:20:38] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-16 05:20:38] [INFO ] Implicit Places using invariants in 448 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 450 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/932 places, 956/1422 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 934
Applied a total of 44 rules in 18 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2023-03-16 05:20:38] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:20:39] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-16 05:20:39] [INFO ] Invariant cache hit.
[2023-03-16 05:20:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-16 05:20:40] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/932 places, 934/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2138 ms. Remains : 405/932 places, 934/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s229 1)), p0:(AND (EQ s374 1) (EQ s401 1) (NOT (AND (EQ s335 1) (EQ s359 1)))), p2:(AND (EQ s335 1) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 692 reset in 617 ms.
Product exploration explored 100000 steps with 708 reset in 517 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:20:42] [INFO ] Invariant cache hit.
[2023-03-16 05:20:42] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 05:20:42] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 05:20:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 05:20:43] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 05:20:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-16 05:20:43] [INFO ] After 73ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-16 05:20:43] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-16 05:20:43] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 934/934 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 933
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 403 transition count 933
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 403 transition count 907
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 403 transition count 883
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 90 place count 379 transition count 871
Applied a total of 90 rules in 51 ms. Remains 379 /405 variables (removed 26) and now considering 871/934 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 379/405 places, 871/934 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished Best-First random walk after 4001 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=500 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 622 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 934/934 transitions.
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 405 transition count 908
Applied a total of 26 rules in 23 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-16 05:20:44] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:20:44] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-16 05:20:44] [INFO ] Invariant cache hit.
[2023-03-16 05:20:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-16 05:20:45] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2023-03-16 05:20:45] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 05:20:45] [INFO ] Invariant cache hit.
[2023-03-16 05:20:46] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/405 places, 908/934 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2101 ms. Remains : 405/405 places, 908/934 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 947 steps, including 6 resets, run visited all 3 properties in 23 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 109 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 688 reset in 462 ms.
Product exploration explored 100000 steps with 676 reset in 503 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-16 05:20:48] [INFO ] Invariant cache hit.
[2023-03-16 05:20:48] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-16 05:20:48] [INFO ] Invariant cache hit.
[2023-03-16 05:20:49] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-16 05:20:50] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2023-03-16 05:20:50] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 05:20:50] [INFO ] Invariant cache hit.
[2023-03-16 05:20:50] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2360 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 13065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-12
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 3 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1113
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1113
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1090
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1090
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1081
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1079
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1078
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 709 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 911 place count 476 transition count 933
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 989 place count 437 transition count 945
Applied a total of 989 rules in 176 ms. Remains 437 /932 variables (removed 495) and now considering 945/1422 (removed 477) transitions.
// Phase 1: matrix 945 rows 437 cols
[2023-03-16 05:20:51] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-16 05:20:51] [INFO ] Implicit Places using invariants in 539 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 541 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/932 places, 945/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 921
Applied a total of 48 rules in 17 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-16 05:20:51] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:20:52] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-16 05:20:52] [INFO ] Invariant cache hit.
[2023-03-16 05:20:52] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-16 05:20:53] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/932 places, 921/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2172 ms. Remains : 404/932 places, 921/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s135 1)), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 692 reset in 442 ms.
Product exploration explored 100000 steps with 688 reset in 489 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 1909 steps, including 12 resets, run visited all 3 properties in 48 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 4 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2023-03-16 05:20:55] [INFO ] Invariant cache hit.
[2023-03-16 05:20:55] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-16 05:20:55] [INFO ] Invariant cache hit.
[2023-03-16 05:20:56] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-16 05:20:56] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2023-03-16 05:20:56] [INFO ] Invariant cache hit.
[2023-03-16 05:20:57] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2143 ms. Remains : 404/404 places, 921/921 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 668 steps, including 4 resets, run visited all 3 properties in 7 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 696 reset in 441 ms.
Product exploration explored 100000 steps with 679 reset in 482 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 404 transition count 897
Applied a total of 24 rules in 19 ms. Remains 404 /404 variables (removed 0) and now considering 897/921 (removed 24) transitions.
[2023-03-16 05:20:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 897 rows 404 cols
[2023-03-16 05:20:59] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 05:21:00] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/404 places, 897/921 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 647 ms. Remains : 404/404 places, 897/921 transitions.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 4 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-16 05:21:00] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 05:21:00] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-16 05:21:00] [INFO ] Invariant cache hit.
[2023-03-16 05:21:01] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-16 05:21:02] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2023-03-16 05:21:02] [INFO ] Invariant cache hit.
[2023-03-16 05:21:03] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2502 ms. Remains : 404/404 places, 921/921 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 12177 ms.
[2023-03-16 05:21:03] [INFO ] Flatten gal took : 75 ms
[2023-03-16 05:21:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 05:21:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 932 places, 1422 transitions and 4485 arcs took 14 ms.
Total runtime 147060 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2305/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2305/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2305/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NoC3x3-PT-6B-LTLFireability-03
Could not compute solution for formula : NoC3x3-PT-6B-LTLFireability-10
Could not compute solution for formula : NoC3x3-PT-6B-LTLFireability-12

BK_STOP 1678944066146

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name NoC3x3-PT-6B-LTLFireability-03
ltl formula formula --ltl=/tmp/2305/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 932 places, 1422 transitions and 4485 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.050 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2305/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2305/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2305/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2305/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name NoC3x3-PT-6B-LTLFireability-10
ltl formula formula --ltl=/tmp/2305/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 932 places, 1422 transitions and 4485 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2305/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2305/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2305/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2305/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name NoC3x3-PT-6B-LTLFireability-12
ltl formula formula --ltl=/tmp/2305/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 932 places, 1422 transitions and 4485 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.060 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2305/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2305/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2305/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2305/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-6B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-6B, 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 r265-smll-167863539900316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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