Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 581K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-3B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716690196854

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 02:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:23:18] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-26 02:23:18] [INFO ] Transformed 2117 places.
[2024-05-26 02:23:18] [INFO ] Transformed 2435 transitions.
[2024-05-26 02:23:18] [INFO ] Found NUPN structural information;
[2024-05-26 02:23:18] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-3B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2112 transition count 2435
Discarding 530 places :
Symmetric choice reduction at 1 with 530 rule applications. Total rules 535 place count 1582 transition count 1905
Iterating global reduction 1 with 530 rules applied. Total rules applied 1065 place count 1582 transition count 1905
Discarding 185 places :
Symmetric choice reduction at 1 with 185 rule applications. Total rules 1250 place count 1397 transition count 1720
Iterating global reduction 1 with 185 rules applied. Total rules applied 1435 place count 1397 transition count 1720
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1438 place count 1397 transition count 1717
Discarding 197 places :
Symmetric choice reduction at 2 with 197 rule applications. Total rules 1635 place count 1200 transition count 1506
Iterating global reduction 2 with 197 rules applied. Total rules applied 1832 place count 1200 transition count 1506
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1881 place count 1151 transition count 1413
Iterating global reduction 2 with 49 rules applied. Total rules applied 1930 place count 1151 transition count 1413
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 1944 place count 1150 transition count 1400
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1975 place count 1119 transition count 1369
Iterating global reduction 3 with 31 rules applied. Total rules applied 2006 place count 1119 transition count 1369
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 2008 place count 1117 transition count 1369
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2029 place count 1096 transition count 1327
Iterating global reduction 4 with 21 rules applied. Total rules applied 2050 place count 1096 transition count 1327
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 2070 place count 1076 transition count 1307
Iterating global reduction 4 with 20 rules applied. Total rules applied 2090 place count 1076 transition count 1307
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 2093 place count 1073 transition count 1307
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 2113 place count 1053 transition count 1287
Iterating global reduction 5 with 20 rules applied. Total rules applied 2133 place count 1053 transition count 1287
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 2153 place count 1053 transition count 1267
Applied a total of 2153 rules in 1281 ms. Remains 1053 /2117 variables (removed 1064) and now considering 1267/2435 (removed 1168) transitions.
// Phase 1: matrix 1267 rows 1053 cols
[2024-05-26 02:23:20] [INFO ] Computed 57 invariants in 31 ms
[2024-05-26 02:23:20] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-26 02:23:20] [INFO ] Invariant cache hit.
[2024-05-26 02:23:21] [INFO ] Implicit Places using invariants and state equation in 896 ms returned [72, 80, 138, 145, 146, 154, 157, 255, 259, 263, 331, 332, 343, 346, 350, 351, 447, 448, 449, 450, 454, 455, 456, 464, 470, 478, 481, 484, 661, 662, 666, 667, 668, 669, 673, 674, 675, 790, 791, 799, 857, 858, 859, 860, 864, 865, 866, 876, 879, 992, 996]
Discarding 51 places :
Implicit Place search using SMT with State Equation took 1416 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1002/2117 places, 1267/2435 transitions.
Applied a total of 0 rules in 25 ms. Remains 1002 /1002 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2724 ms. Remains : 1002/2117 places, 1267/2435 transitions.
Support contains 49 out of 1002 places after structural reductions.
[2024-05-26 02:23:21] [INFO ] Flatten gal took : 101 ms
[2024-05-26 02:23:21] [INFO ] Flatten gal took : 71 ms
[2024-05-26 02:23:21] [INFO ] Input system was already deterministic with 1267 transitions.
Support contains 45 out of 1002 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 32) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 1267 rows 1002 cols
[2024-05-26 02:23:22] [INFO ] Computed 42 invariants in 18 ms
[2024-05-26 02:23:23] [INFO ] [Real]Absence check using 42 positive place invariants in 27 ms returned sat
[2024-05-26 02:23:23] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:23:23] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2024-05-26 02:23:23] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-26 02:23:24] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-26 02:23:24] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 281 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Parikh walk visited 4 properties in 32 ms.
Support contains 1 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 815 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 939 transition count 1063
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 265 place count 807 transition count 1063
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 265 place count 807 transition count 977
Deduced a syphon composed of 86 places in 6 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 437 place count 721 transition count 977
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 476 place count 682 transition count 904
Iterating global reduction 2 with 39 rules applied. Total rules applied 515 place count 682 transition count 904
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 520 place count 682 transition count 899
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 523 place count 679 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 523 place count 679 transition count 897
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 527 place count 677 transition count 897
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 540 place count 664 transition count 874
Iterating global reduction 4 with 13 rules applied. Total rules applied 553 place count 664 transition count 874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 557 place count 664 transition count 870
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 559 place count 662 transition count 870
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 567 place count 654 transition count 861
Iterating global reduction 6 with 8 rules applied. Total rules applied 575 place count 654 transition count 861
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 580 place count 654 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 581 place count 653 transition count 856
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 584 place count 650 transition count 851
Iterating global reduction 8 with 3 rules applied. Total rules applied 587 place count 650 transition count 851
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 588 place count 650 transition count 850
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 590 place count 648 transition count 848
Iterating global reduction 9 with 2 rules applied. Total rules applied 592 place count 648 transition count 848
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 594 place count 648 transition count 846
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 10 with 674 rules applied. Total rules applied 1268 place count 311 transition count 509
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 1282 place count 297 transition count 483
Iterating global reduction 10 with 14 rules applied. Total rules applied 1296 place count 297 transition count 483
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1300 place count 297 transition count 479
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1302 place count 295 transition count 475
Iterating global reduction 11 with 2 rules applied. Total rules applied 1304 place count 295 transition count 475
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1306 place count 293 transition count 471
Iterating global reduction 11 with 2 rules applied. Total rules applied 1308 place count 293 transition count 471
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 1340 place count 277 transition count 501
Free-agglomeration rule applied 23 times.
Iterating global reduction 11 with 23 rules applied. Total rules applied 1363 place count 277 transition count 478
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 30 rules applied. Total rules applied 1393 place count 254 transition count 471
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 12 with 40 rules applied. Total rules applied 1433 place count 254 transition count 442
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 49 rules applied. Total rules applied 1482 place count 214 transition count 433
Applied a total of 1482 rules in 269 ms. Remains 214 /1002 variables (removed 788) and now considering 433/1267 (removed 834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 214/1002 places, 433/1267 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished Best-First random walk after 8267 steps, including 4 resets, run visited all 1 properties in 11 ms. (steps per millisecond=751 )
Parikh walk visited 0 properties in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 815 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 938 transition count 1070
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 805 transition count 1070
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 267 place count 805 transition count 992
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 423 place count 727 transition count 992
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 461 place count 689 transition count 920
Iterating global reduction 2 with 38 rules applied. Total rules applied 499 place count 689 transition count 920
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 504 place count 689 transition count 915
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 507 place count 686 transition count 915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 507 place count 686 transition count 914
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 509 place count 685 transition count 914
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 521 place count 673 transition count 893
Iterating global reduction 4 with 12 rules applied. Total rules applied 533 place count 673 transition count 893
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 537 place count 673 transition count 889
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 539 place count 671 transition count 889
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 546 place count 664 transition count 881
Iterating global reduction 6 with 7 rules applied. Total rules applied 553 place count 664 transition count 881
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 557 place count 664 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 558 place count 663 transition count 877
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 561 place count 660 transition count 872
Iterating global reduction 8 with 3 rules applied. Total rules applied 564 place count 660 transition count 872
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 565 place count 660 transition count 871
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 567 place count 658 transition count 869
Iterating global reduction 9 with 2 rules applied. Total rules applied 569 place count 658 transition count 869
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 571 place count 658 transition count 867
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 10 with 684 rules applied. Total rules applied 1255 place count 316 transition count 525
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 1270 place count 301 transition count 497
Iterating global reduction 10 with 15 rules applied. Total rules applied 1285 place count 301 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1289 place count 301 transition count 493
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1292 place count 298 transition count 487
Iterating global reduction 11 with 3 rules applied. Total rules applied 1295 place count 298 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1296 place count 298 transition count 486
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1298 place count 296 transition count 482
Iterating global reduction 12 with 2 rules applied. Total rules applied 1300 place count 296 transition count 482
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 12 with 28 rules applied. Total rules applied 1328 place count 282 transition count 481
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1329 place count 282 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1330 place count 281 transition count 480
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1338 place count 273 transition count 480
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 13 with 44 rules applied. Total rules applied 1382 place count 251 transition count 458
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 13 with 22 rules applied. Total rules applied 1404 place count 251 transition count 436
Applied a total of 1404 rules in 226 ms. Remains 251 /1002 variables (removed 751) and now considering 436/1267 (removed 831) transitions.
[2024-05-26 02:23:25] [INFO ] Flow matrix only has 428 transitions (discarded 8 similar events)
// Phase 1: matrix 428 rows 251 cols
[2024-05-26 02:23:25] [INFO ] Computed 34 invariants in 4 ms
[2024-05-26 02:23:25] [INFO ] Implicit Places using invariants in 153 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/1002 places, 436/1267 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 248 transition count 432
Applied a total of 6 rules in 10 ms. Remains 248 /250 variables (removed 2) and now considering 432/436 (removed 4) transitions.
[2024-05-26 02:23:25] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 248 cols
[2024-05-26 02:23:25] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:23:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-26 02:23:25] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2024-05-26 02:23:25] [INFO ] Invariant cache hit.
[2024-05-26 02:23:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-26 02:23:26] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [22, 62, 112]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 375 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/1002 places, 432/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 242 transition count 429
Applied a total of 6 rules in 9 ms. Remains 242 /245 variables (removed 3) and now considering 429/432 (removed 3) transitions.
[2024-05-26 02:23:26] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
// Phase 1: matrix 421 rows 242 cols
[2024-05-26 02:23:26] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:23:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-26 02:23:26] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
[2024-05-26 02:23:26] [INFO ] Invariant cache hit.
[2024-05-26 02:23:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-26 02:23:26] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 242/1002 places, 429/1267 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1116 ms. Remains : 242/1002 places, 429/1267 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-00 finished in 1295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p0) U (X(p1)||F(p2)))))'
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 982 transition count 1246
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 982 transition count 1246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 982 transition count 1245
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 969 transition count 1224
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 969 transition count 1224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 969 transition count 1223
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 958 transition count 1210
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 958 transition count 1210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 958 transition count 1208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 101 place count 949 transition count 1196
Iterating global reduction 3 with 9 rules applied. Total rules applied 110 place count 949 transition count 1196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 949 transition count 1192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 118 place count 945 transition count 1188
Iterating global reduction 4 with 4 rules applied. Total rules applied 122 place count 945 transition count 1188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 945 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 126 place count 942 transition count 1184
Iterating global reduction 5 with 3 rules applied. Total rules applied 129 place count 942 transition count 1184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 132 place count 942 transition count 1181
Applied a total of 132 rules in 142 ms. Remains 942 /1002 variables (removed 60) and now considering 1181/1267 (removed 86) transitions.
// Phase 1: matrix 1181 rows 942 cols
[2024-05-26 02:23:26] [INFO ] Computed 42 invariants in 12 ms
[2024-05-26 02:23:27] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-26 02:23:27] [INFO ] Invariant cache hit.
[2024-05-26 02:23:27] [INFO ] Implicit Places using invariants and state equation in 708 ms returned [137, 246, 428]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 929 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 939/1002 places, 1181/1267 transitions.
Applied a total of 0 rules in 21 ms. Remains 939 /939 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1092 ms. Remains : 939/1002 places, 1181/1267 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s392 1), p2:(NEQ s796 1), p1:(NEQ s495 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 654 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-01 finished in 1371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((G(F(!p1))||(F(!p1)&&G(!p2))))))'
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 982 transition count 1244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 982 transition count 1244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 982 transition count 1243
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 968 transition count 1223
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 968 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 968 transition count 1221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 957 transition count 1206
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 957 transition count 1206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 957 transition count 1204
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 104 place count 948 transition count 1193
Iterating global reduction 3 with 9 rules applied. Total rules applied 113 place count 948 transition count 1193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 948 transition count 1190
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 120 place count 944 transition count 1186
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 944 transition count 1186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 944 transition count 1184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 942 transition count 1182
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 942 transition count 1182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 132 place count 942 transition count 1180
Applied a total of 132 rules in 140 ms. Remains 942 /1002 variables (removed 60) and now considering 1180/1267 (removed 87) transitions.
// Phase 1: matrix 1180 rows 942 cols
[2024-05-26 02:23:28] [INFO ] Computed 42 invariants in 7 ms
[2024-05-26 02:23:28] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-26 02:23:28] [INFO ] Invariant cache hit.
[2024-05-26 02:23:29] [INFO ] Implicit Places using invariants and state equation in 719 ms returned [247]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 977 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 941/1002 places, 1180/1267 transitions.
Applied a total of 0 rules in 17 ms. Remains 941 /941 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1135 ms. Remains : 941/1002 places, 1180/1267 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p2 p1), p1, true]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s137 1) (EQ s205 1)), p1:(AND (EQ s427 1) (EQ s450 1)), p0:(OR (EQ s424 0) (EQ s477 0) (AND (EQ s424 1) (EQ s477 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 308 reset in 324 ms.
Product exploration explored 100000 steps with 317 reset in 329 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 p2) (NOT p1) p0), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p2 p1), p1, p1]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1180 rows 941 cols
[2024-05-26 02:23:30] [INFO ] Computed 42 invariants in 10 ms
[2024-05-26 02:23:30] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2024-05-26 02:23:31] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:31] [INFO ] [Nat]Absence check using 42 positive place invariants in 21 ms returned sat
[2024-05-26 02:23:31] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:31] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-26 02:23:31] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 1180/1180 transitions.
Graph (trivial) has 753 edges and 941 vertex of which 72 / 941 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 878 transition count 984
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 249 place count 754 transition count 984
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 249 place count 754 transition count 895
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 427 place count 665 transition count 895
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 450 place count 642 transition count 838
Iterating global reduction 2 with 23 rules applied. Total rules applied 473 place count 642 transition count 838
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 641 transition count 836
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 641 transition count 836
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 476 place count 640 transition count 835
Iterating global reduction 2 with 1 rules applied. Total rules applied 477 place count 640 transition count 835
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 478 place count 639 transition count 833
Iterating global reduction 2 with 1 rules applied. Total rules applied 479 place count 639 transition count 833
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 480 place count 638 transition count 832
Iterating global reduction 2 with 1 rules applied. Total rules applied 481 place count 638 transition count 832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 638 transition count 831
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 328
Deduced a syphon composed of 328 places in 0 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 3 with 656 rules applied. Total rules applied 1138 place count 310 transition count 503
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1149 place count 299 transition count 483
Iterating global reduction 3 with 11 rules applied. Total rules applied 1160 place count 299 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1162 place count 299 transition count 481
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1164 place count 297 transition count 477
Iterating global reduction 4 with 2 rules applied. Total rules applied 1166 place count 297 transition count 477
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1168 place count 295 transition count 473
Iterating global reduction 4 with 2 rules applied. Total rules applied 1170 place count 295 transition count 473
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1206 place count 277 transition count 514
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 1227 place count 277 transition count 493
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1254 place count 256 transition count 487
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1290 place count 256 transition count 463
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1330 place count 220 transition count 459
Applied a total of 1330 rules in 138 ms. Remains 220 /941 variables (removed 721) and now considering 459/1180 (removed 721) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 220/941 places, 459/1180 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048399 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048399 steps, saw 145816 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:23:34] [INFO ] Flow matrix only has 454 transitions (discarded 5 similar events)
// Phase 1: matrix 454 rows 220 cols
[2024-05-26 02:23:34] [INFO ] Computed 42 invariants in 7 ms
[2024-05-26 02:23:34] [INFO ] [Real]Absence check using 42 positive place invariants in 6 ms returned sat
[2024-05-26 02:23:35] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-26 02:23:35] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:35] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-26 02:23:35] [INFO ] After 50ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:35] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-26 02:23:35] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 459/459 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 220/220 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 459/459 transitions.
Applied a total of 0 rules in 6 ms. Remains 220 /220 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-05-26 02:23:35] [INFO ] Flow matrix only has 454 transitions (discarded 5 similar events)
[2024-05-26 02:23:35] [INFO ] Invariant cache hit.
[2024-05-26 02:23:35] [INFO ] Implicit Places using invariants in 124 ms returned [8, 29, 56, 75, 104, 148, 169, 187, 211]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 126 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/220 places, 459/459 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 187 transition count 435
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 72 place count 187 transition count 411
Applied a total of 72 rules in 9 ms. Remains 187 /211 variables (removed 24) and now considering 411/459 (removed 48) transitions.
[2024-05-26 02:23:35] [INFO ] Flow matrix only has 406 transitions (discarded 5 similar events)
// Phase 1: matrix 406 rows 187 cols
[2024-05-26 02:23:35] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:23:35] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 02:23:35] [INFO ] Flow matrix only has 406 transitions (discarded 5 similar events)
[2024-05-26 02:23:35] [INFO ] Invariant cache hit.
[2024-05-26 02:23:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-26 02:23:35] [INFO ] Implicit Places using invariants and state equation in 327 ms returned [77, 85, 140]
Discarding 3 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 446 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 184/220 places, 407/459 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 181 transition count 404
Applied a total of 6 rules in 24 ms. Remains 181 /184 variables (removed 3) and now considering 404/407 (removed 3) transitions.
[2024-05-26 02:23:35] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
// Phase 1: matrix 399 rows 181 cols
[2024-05-26 02:23:35] [INFO ] Computed 31 invariants in 3 ms
[2024-05-26 02:23:36] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 02:23:36] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
[2024-05-26 02:23:36] [INFO ] Invariant cache hit.
[2024-05-26 02:23:36] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-26 02:23:36] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 181/220 places, 404/459 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 989 ms. Remains : 181/220 places, 404/459 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1095969 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1095969 steps, saw 190884 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:23:39] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
[2024-05-26 02:23:39] [INFO ] Invariant cache hit.
[2024-05-26 02:23:39] [INFO ] [Real]Absence check using 31 positive place invariants in 6 ms returned sat
[2024-05-26 02:23:39] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-26 02:23:39] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:39] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-26 02:23:39] [INFO ] After 27ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:39] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-26 02:23:39] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 404/404 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 181/181 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-26 02:23:39] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
[2024-05-26 02:23:39] [INFO ] Invariant cache hit.
[2024-05-26 02:23:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-26 02:23:39] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
[2024-05-26 02:23:39] [INFO ] Invariant cache hit.
[2024-05-26 02:23:40] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-26 02:23:40] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-26 02:23:40] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-26 02:23:40] [INFO ] Flow matrix only has 399 transitions (discarded 5 similar events)
[2024-05-26 02:23:40] [INFO ] Invariant cache hit.
[2024-05-26 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 181/181 places, 404/404 transitions.
Graph (trivial) has 64 edges and 181 vertex of which 44 / 181 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 510 edges and 159 vertex of which 103 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Drop transitions removed 91 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 103 transition count 198
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 126 place count 103 transition count 198
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 103 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 102 transition count 196
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 19 edges and 99 vertex of which 6 / 99 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 96 transition count 196
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 138 place count 96 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 95 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 95 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 95 transition count 187
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 146 place count 95 transition count 182
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 156 place count 90 transition count 177
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 159 place count 90 transition count 177
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 167 place count 87 transition count 172
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 171 place count 87 transition count 168
Applied a total of 171 rules in 26 ms. Remains 87 /181 variables (removed 94) and now considering 168/404 (removed 236) transitions.
Running SMT prover for 1 properties.
[2024-05-26 02:23:40] [INFO ] Flow matrix only has 164 transitions (discarded 4 similar events)
// Phase 1: matrix 164 rows 87 cols
[2024-05-26 02:23:40] [INFO ] Computed 16 invariants in 2 ms
[2024-05-26 02:23:40] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-26 02:23:40] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-26 02:23:40] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:40] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-26 02:23:40] [INFO ] After 13ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:40] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-26 02:23:40] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 9 factoid took 144 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 323 ms :[(AND p2 p1), p1, p1]
Stuttering acceptance computed with spot in 102 ms :[(AND p2 p1), p1, p1]
Support contains 4 out of 941 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 941/941 places, 1180/1180 transitions.
Graph (trivial) has 752 edges and 941 vertex of which 72 / 941 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 877 transition count 992
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 249 place count 753 transition count 992
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 249 place count 753 transition count 912
Deduced a syphon composed of 80 places in 21 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 409 place count 673 transition count 912
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 431 place count 651 transition count 856
Iterating global reduction 2 with 22 rules applied. Total rules applied 453 place count 651 transition count 856
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1125 place count 315 transition count 520
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1136 place count 304 transition count 500
Iterating global reduction 2 with 11 rules applied. Total rules applied 1147 place count 304 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1149 place count 304 transition count 498
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 302 transition count 494
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 302 transition count 494
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 300 transition count 490
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 300 transition count 490
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1185 place count 286 transition count 489
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 1188 place count 286 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1189 place count 285 transition count 488
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1194 place count 280 transition count 488
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1222 place count 266 transition count 474
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1236 place count 266 transition count 460
Applied a total of 1236 rules in 155 ms. Remains 266 /941 variables (removed 675) and now considering 460/1180 (removed 720) transitions.
[2024-05-26 02:23:41] [INFO ] Flow matrix only has 452 transitions (discarded 8 similar events)
// Phase 1: matrix 452 rows 266 cols
[2024-05-26 02:23:41] [INFO ] Computed 37 invariants in 5 ms
[2024-05-26 02:23:41] [INFO ] Implicit Places using invariants in 181 ms returned [7, 31, 67, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 182 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/941 places, 460/1180 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 252 transition count 450
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 252 transition count 440
Applied a total of 30 rules in 9 ms. Remains 252 /262 variables (removed 10) and now considering 440/460 (removed 20) transitions.
[2024-05-26 02:23:41] [INFO ] Flow matrix only has 432 transitions (discarded 8 similar events)
// Phase 1: matrix 432 rows 252 cols
[2024-05-26 02:23:41] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:23:41] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-26 02:23:41] [INFO ] Flow matrix only has 432 transitions (discarded 8 similar events)
[2024-05-26 02:23:41] [INFO ] Invariant cache hit.
[2024-05-26 02:23:41] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:23:41] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/941 places, 440/1180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 833 ms. Remains : 252/941 places, 440/1180 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 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 136 ms :[(AND p2 p1), p1, p1]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:23:42] [INFO ] Flow matrix only has 432 transitions (discarded 8 similar events)
[2024-05-26 02:23:42] [INFO ] Invariant cache hit.
[2024-05-26 02:23:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-26 02:23:42] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-26 02:23:42] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:23:42] [INFO ] After 19ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:42] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-26 02:23:42] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 440/440 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 252 transition count 431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 252 transition count 430
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 251 transition count 430
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 250 transition count 429
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 250 transition count 429
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 249 transition count 427
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 249 transition count 427
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 248 transition count 425
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 248 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 248 transition count 424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 246 transition count 435
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 49 place count 246 transition count 408
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 82 place count 219 transition count 402
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 118 place count 219 transition count 374
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 171 place count 179 transition count 361
Applied a total of 171 rules in 29 ms. Remains 179 /252 variables (removed 73) and now considering 361/440 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 179/252 places, 361/440 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1425514 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :{}
Probabilistic random walk after 1425514 steps, saw 182713 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:23:45] [INFO ] Flow matrix only has 359 transitions (discarded 2 similar events)
// Phase 1: matrix 359 rows 179 cols
[2024-05-26 02:23:45] [INFO ] Computed 29 invariants in 6 ms
[2024-05-26 02:23:45] [INFO ] [Real]Absence check using 29 positive place invariants in 4 ms returned sat
[2024-05-26 02:23:46] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:46] [INFO ] [Nat]Absence check using 29 positive place invariants in 4 ms returned sat
[2024-05-26 02:23:46] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 02:23:46] [INFO ] After 21ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:46] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-26 02:23:46] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 361/361 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 361/361 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-05-26 02:23:46] [INFO ] Flow matrix only has 359 transitions (discarded 2 similar events)
[2024-05-26 02:23:46] [INFO ] Invariant cache hit.
[2024-05-26 02:23:46] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-26 02:23:46] [INFO ] Flow matrix only has 359 transitions (discarded 2 similar events)
[2024-05-26 02:23:46] [INFO ] Invariant cache hit.
[2024-05-26 02:23:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 02:23:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [77, 85]
Discarding 2 places :
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 338 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/179 places, 359/361 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 176 transition count 358
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 176 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 174 transition count 356
Applied a total of 6 rules in 11 ms. Remains 174 /177 variables (removed 3) and now considering 356/359 (removed 3) transitions.
[2024-05-26 02:23:46] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
// Phase 1: matrix 354 rows 174 cols
[2024-05-26 02:23:46] [INFO ] Computed 28 invariants in 2 ms
[2024-05-26 02:23:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-26 02:23:46] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2024-05-26 02:23:46] [INFO ] Invariant cache hit.
[2024-05-26 02:23:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-26 02:23:46] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 174/179 places, 356/361 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 664 ms. Remains : 174/179 places, 356/361 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1395415 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1395415 steps, saw 188960 distinct states, run finished after 3004 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:23:49] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2024-05-26 02:23:49] [INFO ] Invariant cache hit.
[2024-05-26 02:23:50] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2024-05-26 02:23:50] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:50] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned sat
[2024-05-26 02:23:50] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-26 02:23:50] [INFO ] After 21ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:50] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-26 02:23:50] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 174/174 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 02:23:50] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2024-05-26 02:23:50] [INFO ] Invariant cache hit.
[2024-05-26 02:23:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-26 02:23:50] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2024-05-26 02:23:50] [INFO ] Invariant cache hit.
[2024-05-26 02:23:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-26 02:23:50] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-26 02:23:50] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-26 02:23:50] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2024-05-26 02:23:50] [INFO ] Invariant cache hit.
[2024-05-26 02:23:50] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 174/174 places, 356/356 transitions.
Graph (trivial) has 64 edges and 174 vertex of which 44 / 174 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 453 edges and 152 vertex of which 103 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Drop transitions removed 69 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 103 transition count 198
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 28 edges and 100 vertex of which 6 / 100 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 97 transition count 198
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 97 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 96 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 96 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 96 transition count 189
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 96 transition count 186
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 100 place count 96 transition count 178
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t624.t1136.t578.t1141 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 108 place count 86 transition count 170
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t170.t1255.t121.t1256 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 114 place count 83 transition count 163
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 83 transition count 163
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 127 place count 80 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 129 place count 79 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 137 place count 79 transition count 154
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 138 place count 79 transition count 153
Applied a total of 138 rules in 14 ms. Remains 79 /174 variables (removed 95) and now considering 153/356 (removed 203) transitions.
Running SMT prover for 1 properties.
[2024-05-26 02:23:50] [INFO ] Flow matrix only has 151 transitions (discarded 2 similar events)
// Phase 1: matrix 151 rows 79 cols
[2024-05-26 02:23:50] [INFO ] Computed 13 invariants in 1 ms
[2024-05-26 02:23:50] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2024-05-26 02:23:50] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:23:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-26 02:23:51] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-26 02:23:51] [INFO ] After 10ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:23:51] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-26 02:23:51] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 7 factoid took 193 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 109 ms :[(AND p2 p1), p1, p1]
Stuttering acceptance computed with spot in 94 ms :[(AND p2 p1), p1, p1]
Stuttering acceptance computed with spot in 105 ms :[(AND p2 p1), p1, p1]
Product exploration explored 100000 steps with 1233 reset in 389 ms.
Stuttering criterion allowed to conclude after 40624 steps with 500 reset in 163 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-02 finished in 24047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((X((G(p2)&&p1))&&F(p3))))))'
Support contains 4 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 813 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 938 transition count 1070
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 805 transition count 1070
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 267 place count 805 transition count 993
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 421 place count 728 transition count 993
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 459 place count 690 transition count 921
Iterating global reduction 2 with 38 rules applied. Total rules applied 497 place count 690 transition count 921
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 502 place count 690 transition count 916
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 505 place count 687 transition count 916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 505 place count 687 transition count 915
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 507 place count 686 transition count 915
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 519 place count 674 transition count 894
Iterating global reduction 4 with 12 rules applied. Total rules applied 531 place count 674 transition count 894
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 535 place count 674 transition count 890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 537 place count 672 transition count 890
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 545 place count 664 transition count 881
Iterating global reduction 6 with 8 rules applied. Total rules applied 553 place count 664 transition count 881
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 558 place count 664 transition count 876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 559 place count 663 transition count 876
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 562 place count 660 transition count 871
Iterating global reduction 8 with 3 rules applied. Total rules applied 565 place count 660 transition count 871
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 566 place count 660 transition count 870
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 568 place count 658 transition count 868
Iterating global reduction 9 with 2 rules applied. Total rules applied 570 place count 658 transition count 868
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 572 place count 658 transition count 866
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 10 with 682 rules applied. Total rules applied 1254 place count 317 transition count 525
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 1269 place count 302 transition count 497
Iterating global reduction 10 with 15 rules applied. Total rules applied 1284 place count 302 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1288 place count 302 transition count 493
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1291 place count 299 transition count 487
Iterating global reduction 11 with 3 rules applied. Total rules applied 1294 place count 299 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1295 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1297 place count 297 transition count 482
Iterating global reduction 12 with 2 rules applied. Total rules applied 1299 place count 297 transition count 482
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 12 with 28 rules applied. Total rules applied 1327 place count 283 transition count 484
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 1331 place count 283 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1332 place count 282 transition count 483
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 8 rules applied. Total rules applied 1340 place count 275 transition count 482
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1342 place count 274 transition count 481
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 1378 place count 256 transition count 463
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 14 with 19 rules applied. Total rules applied 1397 place count 256 transition count 444
Applied a total of 1397 rules in 160 ms. Remains 256 /1002 variables (removed 746) and now considering 444/1267 (removed 823) transitions.
[2024-05-26 02:23:52] [INFO ] Flow matrix only has 434 transitions (discarded 10 similar events)
// Phase 1: matrix 434 rows 256 cols
[2024-05-26 02:23:52] [INFO ] Computed 35 invariants in 4 ms
[2024-05-26 02:23:52] [INFO ] Implicit Places using invariants in 121 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1002 places, 444/1267 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 253 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 253 transition count 440
Applied a total of 6 rules in 7 ms. Remains 253 /255 variables (removed 2) and now considering 440/444 (removed 4) transitions.
[2024-05-26 02:23:52] [INFO ] Flow matrix only has 430 transitions (discarded 10 similar events)
// Phase 1: matrix 430 rows 253 cols
[2024-05-26 02:23:52] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:23:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-26 02:23:52] [INFO ] Flow matrix only has 430 transitions (discarded 10 similar events)
[2024-05-26 02:23:52] [INFO ] Invariant cache hit.
[2024-05-26 02:23:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-26 02:23:52] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [22, 66, 117]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 392 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/1002 places, 440/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 247 transition count 437
Applied a total of 6 rules in 7 ms. Remains 247 /250 variables (removed 3) and now considering 437/440 (removed 3) transitions.
[2024-05-26 02:23:52] [INFO ] Flow matrix only has 427 transitions (discarded 10 similar events)
// Phase 1: matrix 427 rows 247 cols
[2024-05-26 02:23:52] [INFO ] Computed 34 invariants in 2 ms
[2024-05-26 02:23:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-26 02:23:52] [INFO ] Flow matrix only has 427 transitions (discarded 10 similar events)
[2024-05-26 02:23:52] [INFO ] Invariant cache hit.
[2024-05-26 02:23:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-26 02:23:53] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 247/1002 places, 437/1267 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1058 ms. Remains : 247/1002 places, 437/1267 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p3), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={1} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 p2)), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (AND p1 p2)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s42 0)), p3:(EQ s71 0), p1:(AND (OR (EQ s27 0) (EQ s42 0)) (EQ s61 0)), p2:(EQ s61 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-03 finished in 1382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p0))'
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 815 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 938 transition count 1071
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 265 place count 806 transition count 1071
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 265 place count 806 transition count 993
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 421 place count 728 transition count 993
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 460 place count 689 transition count 920
Iterating global reduction 2 with 39 rules applied. Total rules applied 499 place count 689 transition count 920
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 504 place count 689 transition count 915
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 507 place count 686 transition count 915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 507 place count 686 transition count 914
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 509 place count 685 transition count 914
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 522 place count 672 transition count 891
Iterating global reduction 4 with 13 rules applied. Total rules applied 535 place count 672 transition count 891
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 539 place count 672 transition count 887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 541 place count 670 transition count 887
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 549 place count 662 transition count 878
Iterating global reduction 6 with 8 rules applied. Total rules applied 557 place count 662 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 562 place count 662 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 563 place count 661 transition count 873
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 566 place count 658 transition count 868
Iterating global reduction 8 with 3 rules applied. Total rules applied 569 place count 658 transition count 868
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 570 place count 658 transition count 867
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 572 place count 656 transition count 865
Iterating global reduction 9 with 2 rules applied. Total rules applied 574 place count 656 transition count 865
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 576 place count 656 transition count 863
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 0 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 10 with 686 rules applied. Total rules applied 1262 place count 313 transition count 520
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 1277 place count 298 transition count 492
Iterating global reduction 10 with 15 rules applied. Total rules applied 1292 place count 298 transition count 492
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1296 place count 298 transition count 488
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1299 place count 295 transition count 482
Iterating global reduction 11 with 3 rules applied. Total rules applied 1302 place count 295 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1303 place count 295 transition count 481
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1305 place count 293 transition count 477
Iterating global reduction 12 with 2 rules applied. Total rules applied 1307 place count 293 transition count 477
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1333 place count 280 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1334 place count 279 transition count 475
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1337 place count 276 transition count 475
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1351 place count 269 transition count 468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1358 place count 269 transition count 461
Applied a total of 1358 rules in 144 ms. Remains 269 /1002 variables (removed 733) and now considering 461/1267 (removed 806) transitions.
[2024-05-26 02:23:53] [INFO ] Flow matrix only has 453 transitions (discarded 8 similar events)
// Phase 1: matrix 453 rows 269 cols
[2024-05-26 02:23:53] [INFO ] Computed 39 invariants in 4 ms
[2024-05-26 02:23:53] [INFO ] Implicit Places using invariants in 139 ms returned [7, 31, 66, 90, 126, 179]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 141 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 263/1002 places, 461/1267 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 246 transition count 444
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 51 place count 246 transition count 427
Applied a total of 51 rules in 8 ms. Remains 246 /263 variables (removed 17) and now considering 427/461 (removed 34) transitions.
[2024-05-26 02:23:53] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 246 cols
[2024-05-26 02:23:53] [INFO ] Computed 33 invariants in 6 ms
[2024-05-26 02:23:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-26 02:23:53] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2024-05-26 02:23:53] [INFO ] Invariant cache hit.
[2024-05-26 02:23:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-26 02:23:54] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [22, 58, 108]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 404 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 243/1002 places, 427/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 240 transition count 424
Applied a total of 6 rules in 8 ms. Remains 240 /243 variables (removed 3) and now considering 424/427 (removed 3) transitions.
[2024-05-26 02:23:54] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
// Phase 1: matrix 416 rows 240 cols
[2024-05-26 02:23:54] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:23:54] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-26 02:23:54] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
[2024-05-26 02:23:54] [INFO ] Invariant cache hit.
[2024-05-26 02:23:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-26 02:23:54] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 240/1002 places, 424/1267 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1090 ms. Remains : 240/1002 places, 424/1267 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s179 1) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-04 finished in 1178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 979 transition count 1241
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 979 transition count 1241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 979 transition count 1240
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 63 place count 963 transition count 1216
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 963 transition count 1216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 963 transition count 1214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 950 transition count 1197
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 950 transition count 1197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 950 transition count 1195
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 120 place count 939 transition count 1181
Iterating global reduction 3 with 11 rules applied. Total rules applied 131 place count 939 transition count 1181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 135 place count 939 transition count 1177
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 140 place count 934 transition count 1172
Iterating global reduction 4 with 5 rules applied. Total rules applied 145 place count 934 transition count 1172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 934 transition count 1170
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 150 place count 931 transition count 1167
Iterating global reduction 5 with 3 rules applied. Total rules applied 153 place count 931 transition count 1167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 156 place count 931 transition count 1164
Applied a total of 156 rules in 143 ms. Remains 931 /1002 variables (removed 71) and now considering 1164/1267 (removed 103) transitions.
// Phase 1: matrix 1164 rows 931 cols
[2024-05-26 02:23:54] [INFO ] Computed 42 invariants in 8 ms
[2024-05-26 02:23:55] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-26 02:23:55] [INFO ] Invariant cache hit.
[2024-05-26 02:23:55] [INFO ] Implicit Places using invariants and state equation in 707 ms returned [137, 246, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 964 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/1002 places, 1164/1267 transitions.
Applied a total of 0 rules in 21 ms. Remains 928 /928 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1128 ms. Remains : 928/1002 places, 1164/1267 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s273 0), p0:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 159 reset in 265 ms.
Product exploration explored 100000 steps with 159 reset in 288 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/928 stabilizing places and 65/1164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 317 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 141 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 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 928 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 928/928 places, 1164/1164 transitions.
Graph (trivial) has 744 edges and 928 vertex of which 72 / 928 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 864 transition count 979
Reduce places removed 121 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 743 transition count 978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 742 transition count 978
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 245 place count 742 transition count 898
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 405 place count 662 transition count 898
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 427 place count 640 transition count 842
Iterating global reduction 3 with 22 rules applied. Total rules applied 449 place count 640 transition count 842
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1125 place count 302 transition count 504
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1136 place count 291 transition count 484
Iterating global reduction 3 with 11 rules applied. Total rules applied 1147 place count 291 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1149 place count 291 transition count 482
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1151 place count 289 transition count 478
Iterating global reduction 4 with 2 rules applied. Total rules applied 1153 place count 289 transition count 478
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1155 place count 287 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 1157 place count 287 transition count 474
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1183 place count 274 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1184 place count 273 transition count 472
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1190 place count 267 transition count 472
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1224 place count 250 transition count 455
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1241 place count 250 transition count 438
Applied a total of 1241 rules in 79 ms. Remains 250 /928 variables (removed 678) and now considering 438/1164 (removed 726) transitions.
[2024-05-26 02:23:57] [INFO ] Flow matrix only has 430 transitions (discarded 8 similar events)
// Phase 1: matrix 430 rows 250 cols
[2024-05-26 02:23:57] [INFO ] Computed 36 invariants in 3 ms
[2024-05-26 02:23:57] [INFO ] Implicit Places using invariants in 159 ms returned [8, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/928 places, 438/1164 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 243 transition count 433
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 243 transition count 428
Applied a total of 15 rules in 12 ms. Remains 243 /248 variables (removed 5) and now considering 428/438 (removed 10) transitions.
[2024-05-26 02:23:57] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 243 cols
[2024-05-26 02:23:57] [INFO ] Computed 34 invariants in 2 ms
[2024-05-26 02:23:57] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-26 02:23:57] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:23:57] [INFO ] Invariant cache hit.
[2024-05-26 02:23:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:23:57] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 243/928 places, 428/1164 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 710 ms. Remains : 243/928 places, 428/1164 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/243 stabilizing places and 2/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 194 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 p1) (NOT p0)), (NOT p0)]
Finished random walk after 323 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 239 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 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1223 reset in 347 ms.
Product exploration explored 100000 steps with 1228 reset in 351 ms.
Built C files in :
/tmp/ltsmin16621742134731141008
[2024-05-26 02:23:59] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2024-05-26 02:23:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:23:59] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2024-05-26 02:23:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:23:59] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2024-05-26 02:23:59] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:23:59] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621742134731141008
Running compilation step : cd /tmp/ltsmin16621742134731141008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 962 ms.
Running link step : cd /tmp/ltsmin16621742134731141008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16621742134731141008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3501269495895395124.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 428/428 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-05-26 02:24:14] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:24:14] [INFO ] Invariant cache hit.
[2024-05-26 02:24:14] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-26 02:24:14] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:24:14] [INFO ] Invariant cache hit.
[2024-05-26 02:24:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:24:14] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-26 02:24:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 02:24:14] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:24:14] [INFO ] Invariant cache hit.
[2024-05-26 02:24:15] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 243/243 places, 428/428 transitions.
Built C files in :
/tmp/ltsmin12393633591184647724
[2024-05-26 02:24:15] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2024-05-26 02:24:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:15] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2024-05-26 02:24:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:15] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2024-05-26 02:24:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:15] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12393633591184647724
Running compilation step : cd /tmp/ltsmin12393633591184647724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 851 ms.
Running link step : cd /tmp/ltsmin12393633591184647724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12393633591184647724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16387948030430936577.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:24:30] [INFO ] Flatten gal took : 21 ms
[2024-05-26 02:24:30] [INFO ] Flatten gal took : 20 ms
[2024-05-26 02:24:30] [INFO ] Time to serialize gal into /tmp/LTL7793121093094908390.gal : 5 ms
[2024-05-26 02:24:30] [INFO ] Time to serialize properties into /tmp/LTL10581012941391896818.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7793121093094908390.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12505551100195860636.hoa' '-atoms' '/tmp/LTL10581012941391896818.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10581012941391896818.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12505551100195860636.hoa
Detected timeout of ITS tools.
[2024-05-26 02:24:45] [INFO ] Flatten gal took : 19 ms
[2024-05-26 02:24:45] [INFO ] Flatten gal took : 17 ms
[2024-05-26 02:24:45] [INFO ] Time to serialize gal into /tmp/LTL9680190465489758927.gal : 3 ms
[2024-05-26 02:24:45] [INFO ] Time to serialize properties into /tmp/LTL10644702989883116696.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9680190465489758927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10644702989883116696.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p50==0)")))||(G("(p460==0)")))))
Formula 0 simplified : X(GF!"(p50==0)" & F!"(p460==0)")
Detected timeout of ITS tools.
[2024-05-26 02:25:00] [INFO ] Flatten gal took : 17 ms
[2024-05-26 02:25:00] [INFO ] Applying decomposition
[2024-05-26 02:25:00] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14847825275924066015.txt' '-o' '/tmp/graph14847825275924066015.bin' '-w' '/tmp/graph14847825275924066015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14847825275924066015.bin' '-l' '-1' '-v' '-w' '/tmp/graph14847825275924066015.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:25:00] [INFO ] Decomposing Gal with order
[2024-05-26 02:25:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:25:00] [INFO ] Removed a total of 331 redundant transitions.
[2024-05-26 02:25:01] [INFO ] Flatten gal took : 347 ms
[2024-05-26 02:25:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 56 ms.
[2024-05-26 02:25:01] [INFO ] Time to serialize gal into /tmp/LTL18247076964089497714.gal : 12 ms
[2024-05-26 02:25:01] [INFO ] Time to serialize properties into /tmp/LTL5952791414370177780.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18247076964089497714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5952791414370177780.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i1.i0.u12.p50==0)")))||(G("(i2.i0.u14.p460==0)")))))
Formula 0 simplified : X(GF!"(i1.i0.u12.p50==0)" & F!"(i2.i0.u14.p460==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15416429305854760847
[2024-05-26 02:25:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15416429305854760847
Running compilation step : cd /tmp/ltsmin15416429305854760847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 633 ms.
Running link step : cd /tmp/ltsmin15416429305854760847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15416429305854760847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-3B-LTLFireability-06 finished in 96822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 815 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 938 transition count 1071
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 265 place count 806 transition count 1071
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 265 place count 806 transition count 993
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 421 place count 728 transition count 993
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 458 place count 691 transition count 922
Iterating global reduction 2 with 37 rules applied. Total rules applied 495 place count 691 transition count 922
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 500 place count 691 transition count 917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 503 place count 688 transition count 917
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 503 place count 688 transition count 916
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 505 place count 687 transition count 916
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 517 place count 675 transition count 895
Iterating global reduction 4 with 12 rules applied. Total rules applied 529 place count 675 transition count 895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 533 place count 675 transition count 891
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 535 place count 673 transition count 891
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 542 place count 666 transition count 883
Iterating global reduction 6 with 7 rules applied. Total rules applied 549 place count 666 transition count 883
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 554 place count 666 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 555 place count 665 transition count 878
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 557 place count 663 transition count 875
Iterating global reduction 8 with 2 rules applied. Total rules applied 559 place count 663 transition count 875
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 560 place count 663 transition count 874
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 561 place count 662 transition count 873
Iterating global reduction 9 with 1 rules applied. Total rules applied 562 place count 662 transition count 873
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 563 place count 662 transition count 872
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 10 with 692 rules applied. Total rules applied 1255 place count 316 transition count 526
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 1269 place count 302 transition count 500
Iterating global reduction 10 with 14 rules applied. Total rules applied 1283 place count 302 transition count 500
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1286 place count 302 transition count 497
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1289 place count 299 transition count 491
Iterating global reduction 11 with 3 rules applied. Total rules applied 1292 place count 299 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1293 place count 299 transition count 490
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1295 place count 297 transition count 486
Iterating global reduction 12 with 2 rules applied. Total rules applied 1297 place count 297 transition count 486
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1323 place count 284 transition count 485
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1324 place count 284 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1325 place count 283 transition count 484
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1334 place count 274 transition count 484
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 13 with 48 rules applied. Total rules applied 1382 place count 250 transition count 460
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 13 with 24 rules applied. Total rules applied 1406 place count 250 transition count 436
Applied a total of 1406 rules in 154 ms. Remains 250 /1002 variables (removed 752) and now considering 436/1267 (removed 831) transitions.
[2024-05-26 02:25:31] [INFO ] Flow matrix only has 428 transitions (discarded 8 similar events)
// Phase 1: matrix 428 rows 250 cols
[2024-05-26 02:25:31] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:25:31] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 02:25:31] [INFO ] Flow matrix only has 428 transitions (discarded 8 similar events)
[2024-05-26 02:25:31] [INFO ] Invariant cache hit.
[2024-05-26 02:25:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:25:32] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [21, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 443 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/1002 places, 436/1267 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 434
Applied a total of 4 rules in 10 ms. Remains 246 /248 variables (removed 2) and now considering 434/436 (removed 2) transitions.
[2024-05-26 02:25:32] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
// Phase 1: matrix 426 rows 246 cols
[2024-05-26 02:25:32] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:25:32] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-26 02:25:32] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
[2024-05-26 02:25:32] [INFO ] Invariant cache hit.
[2024-05-26 02:25:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:25:32] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/1002 places, 434/1267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 980 ms. Remains : 246/1002 places, 434/1267 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s55 0) (EQ s63 0)), p0:(EQ s220 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 821 steps with 10 reset in 5 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-07 finished in 1147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 980 transition count 1242
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 980 transition count 1242
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 60 place count 964 transition count 1218
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 964 transition count 1218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 964 transition count 1216
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 91 place count 951 transition count 1199
Iterating global reduction 1 with 13 rules applied. Total rules applied 104 place count 951 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 951 transition count 1197
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 117 place count 940 transition count 1183
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 940 transition count 1183
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 940 transition count 1179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 935 transition count 1174
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 935 transition count 1174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 935 transition count 1172
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 932 transition count 1169
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 932 transition count 1169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 153 place count 932 transition count 1166
Applied a total of 153 rules in 148 ms. Remains 932 /1002 variables (removed 70) and now considering 1166/1267 (removed 101) transitions.
// Phase 1: matrix 1166 rows 932 cols
[2024-05-26 02:25:32] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:25:33] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-26 02:25:33] [INFO ] Invariant cache hit.
[2024-05-26 02:25:33] [INFO ] Implicit Places using invariants and state equation in 713 ms returned [137, 246, 425]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 956 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/1002 places, 1166/1267 transitions.
Applied a total of 0 rules in 15 ms. Remains 929 /929 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1122 ms. Remains : 929/1002 places, 1166/1267 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s317 1) (EQ s346 1)), p0:(NEQ s574 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 223 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-08 finished in 1218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(F(p1)&&G(p2))))'
Support contains 4 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 811 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 938 transition count 1071
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 265 place count 806 transition count 1071
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 265 place count 806 transition count 993
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 421 place count 728 transition count 993
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 458 place count 691 transition count 923
Iterating global reduction 2 with 37 rules applied. Total rules applied 495 place count 691 transition count 923
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 500 place count 691 transition count 918
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 503 place count 688 transition count 918
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 503 place count 688 transition count 917
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 505 place count 687 transition count 917
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 516 place count 676 transition count 897
Iterating global reduction 4 with 11 rules applied. Total rules applied 527 place count 676 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 529 place count 676 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 675 transition count 895
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 537 place count 668 transition count 887
Iterating global reduction 6 with 7 rules applied. Total rules applied 544 place count 668 transition count 887
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 548 place count 668 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 549 place count 667 transition count 883
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 552 place count 664 transition count 878
Iterating global reduction 8 with 3 rules applied. Total rules applied 555 place count 664 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 556 place count 664 transition count 877
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 558 place count 662 transition count 875
Iterating global reduction 9 with 2 rules applied. Total rules applied 560 place count 662 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 562 place count 662 transition count 873
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 0 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 10 with 686 rules applied. Total rules applied 1248 place count 319 transition count 530
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 1263 place count 304 transition count 502
Iterating global reduction 10 with 15 rules applied. Total rules applied 1278 place count 304 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1282 place count 304 transition count 498
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1285 place count 301 transition count 492
Iterating global reduction 11 with 3 rules applied. Total rules applied 1288 place count 301 transition count 492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1289 place count 301 transition count 491
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1291 place count 299 transition count 487
Iterating global reduction 12 with 2 rules applied. Total rules applied 1293 place count 299 transition count 487
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1319 place count 286 transition count 486
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1320 place count 286 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1321 place count 285 transition count 485
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1323 place count 283 transition count 485
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1333 place count 278 transition count 480
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1338 place count 278 transition count 475
Applied a total of 1338 rules in 157 ms. Remains 278 /1002 variables (removed 724) and now considering 475/1267 (removed 792) transitions.
[2024-05-26 02:25:34] [INFO ] Flow matrix only has 467 transitions (discarded 8 similar events)
// Phase 1: matrix 467 rows 278 cols
[2024-05-26 02:25:34] [INFO ] Computed 40 invariants in 3 ms
[2024-05-26 02:25:34] [INFO ] Implicit Places using invariants in 141 ms returned [7, 31, 66, 90, 126, 181, 215]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 142 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1002 places, 475/1267 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 252 transition count 456
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 252 transition count 437
Applied a total of 57 rules in 10 ms. Remains 252 /271 variables (removed 19) and now considering 437/475 (removed 38) transitions.
[2024-05-26 02:25:34] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
// Phase 1: matrix 429 rows 252 cols
[2024-05-26 02:25:34] [INFO ] Computed 33 invariants in 1 ms
[2024-05-26 02:25:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-26 02:25:34] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
[2024-05-26 02:25:34] [INFO ] Invariant cache hit.
[2024-05-26 02:25:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:25:34] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [22, 58, 108]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 418 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/1002 places, 437/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 246 transition count 434
Applied a total of 6 rules in 7 ms. Remains 246 /249 variables (removed 3) and now considering 434/437 (removed 3) transitions.
[2024-05-26 02:25:34] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
// Phase 1: matrix 426 rows 246 cols
[2024-05-26 02:25:34] [INFO ] Computed 33 invariants in 1 ms
[2024-05-26 02:25:34] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-26 02:25:34] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
[2024-05-26 02:25:34] [INFO ] Invariant cache hit.
[2024-05-26 02:25:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-26 02:25:34] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 246/1002 places, 434/1267 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1119 ms. Remains : 246/1002 places, 434/1267 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s131 1), p2:(OR (EQ s197 0) (EQ s222 0)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-09 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p0||F(G((p0 U (p1||X(p0))))))))'
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 814 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 938 transition count 1071
Reduce places removed 132 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 806 transition count 1070
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 805 transition count 1070
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 267 place count 805 transition count 992
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 423 place count 727 transition count 992
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 461 place count 689 transition count 920
Iterating global reduction 3 with 38 rules applied. Total rules applied 499 place count 689 transition count 920
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 504 place count 689 transition count 915
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 507 place count 686 transition count 915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 507 place count 686 transition count 914
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 509 place count 685 transition count 914
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 521 place count 673 transition count 892
Iterating global reduction 5 with 12 rules applied. Total rules applied 533 place count 673 transition count 892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 537 place count 673 transition count 888
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 539 place count 671 transition count 888
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 547 place count 663 transition count 879
Iterating global reduction 7 with 8 rules applied. Total rules applied 555 place count 663 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 560 place count 663 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 561 place count 662 transition count 874
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 564 place count 659 transition count 869
Iterating global reduction 9 with 3 rules applied. Total rules applied 567 place count 659 transition count 869
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 568 place count 659 transition count 868
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 570 place count 657 transition count 866
Iterating global reduction 10 with 2 rules applied. Total rules applied 572 place count 657 transition count 866
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 574 place count 657 transition count 864
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 11 with 690 rules applied. Total rules applied 1264 place count 312 transition count 519
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 1279 place count 297 transition count 491
Iterating global reduction 11 with 15 rules applied. Total rules applied 1294 place count 297 transition count 491
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1298 place count 297 transition count 487
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1301 place count 294 transition count 481
Iterating global reduction 12 with 3 rules applied. Total rules applied 1304 place count 294 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1305 place count 294 transition count 480
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1307 place count 292 transition count 476
Iterating global reduction 13 with 2 rules applied. Total rules applied 1309 place count 292 transition count 476
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 1333 place count 280 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1334 place count 279 transition count 474
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 1343 place count 270 transition count 474
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 14 with 48 rules applied. Total rules applied 1391 place count 246 transition count 450
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 14 with 24 rules applied. Total rules applied 1415 place count 246 transition count 426
Applied a total of 1415 rules in 145 ms. Remains 246 /1002 variables (removed 756) and now considering 426/1267 (removed 841) transitions.
[2024-05-26 02:25:35] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
// Phase 1: matrix 418 rows 246 cols
[2024-05-26 02:25:35] [INFO ] Computed 33 invariants in 3 ms
[2024-05-26 02:25:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-26 02:25:35] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
[2024-05-26 02:25:35] [INFO ] Invariant cache hit.
[2024-05-26 02:25:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-26 02:25:35] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [22, 58, 108]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 425 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1002 places, 426/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 240 transition count 423
Applied a total of 6 rules in 7 ms. Remains 240 /243 variables (removed 3) and now considering 423/426 (removed 3) transitions.
[2024-05-26 02:25:35] [INFO ] Flow matrix only has 415 transitions (discarded 8 similar events)
// Phase 1: matrix 415 rows 240 cols
[2024-05-26 02:25:35] [INFO ] Computed 33 invariants in 1 ms
[2024-05-26 02:25:35] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-26 02:25:35] [INFO ] Flow matrix only has 415 transitions (discarded 8 similar events)
[2024-05-26 02:25:35] [INFO ] Invariant cache hit.
[2024-05-26 02:25:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-26 02:25:36] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 240/1002 places, 423/1267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 930 ms. Remains : 240/1002 places, 423/1267 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s119 1), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-10 finished in 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(G(p1))))))'
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 981 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 981 transition count 1243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 981 transition count 1242
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 966 transition count 1219
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 966 transition count 1219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 966 transition count 1217
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 87 place count 954 transition count 1202
Iterating global reduction 2 with 12 rules applied. Total rules applied 99 place count 954 transition count 1202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 954 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 111 place count 944 transition count 1187
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 944 transition count 1187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 125 place count 944 transition count 1183
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 130 place count 939 transition count 1178
Iterating global reduction 4 with 5 rules applied. Total rules applied 135 place count 939 transition count 1178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 939 transition count 1176
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 936 transition count 1173
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 936 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 936 transition count 1170
Applied a total of 146 rules in 136 ms. Remains 936 /1002 variables (removed 66) and now considering 1170/1267 (removed 97) transitions.
// Phase 1: matrix 1170 rows 936 cols
[2024-05-26 02:25:36] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:25:36] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-26 02:25:36] [INFO ] Invariant cache hit.
[2024-05-26 02:25:37] [INFO ] Implicit Places using invariants and state equation in 684 ms returned [137, 246, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 917 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 933/1002 places, 1170/1267 transitions.
Applied a total of 0 rules in 18 ms. Remains 933 /933 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1073 ms. Remains : 933/1002 places, 1170/1267 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s626 0), p0:(OR (EQ s19 1) (EQ s646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 158 reset in 224 ms.
Entered a terminal (fully accepting) state of product in 10782 steps with 17 reset in 38 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-11 finished in 1571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p1)))&&p0))))'
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 981 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 981 transition count 1243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 981 transition count 1242
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 966 transition count 1219
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 966 transition count 1219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 966 transition count 1218
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 953 transition count 1201
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 953 transition count 1201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 953 transition count 1199
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 113 place count 942 transition count 1185
Iterating global reduction 3 with 11 rules applied. Total rules applied 124 place count 942 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 942 transition count 1181
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 133 place count 937 transition count 1176
Iterating global reduction 4 with 5 rules applied. Total rules applied 138 place count 937 transition count 1176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 937 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 143 place count 934 transition count 1171
Iterating global reduction 5 with 3 rules applied. Total rules applied 146 place count 934 transition count 1171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 149 place count 934 transition count 1168
Applied a total of 149 rules in 131 ms. Remains 934 /1002 variables (removed 68) and now considering 1168/1267 (removed 99) transitions.
// Phase 1: matrix 1168 rows 934 cols
[2024-05-26 02:25:37] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:25:38] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-26 02:25:38] [INFO ] Invariant cache hit.
[2024-05-26 02:25:38] [INFO ] Implicit Places using invariants and state equation in 648 ms returned [138, 247, 425]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 903 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/1002 places, 1168/1267 transitions.
Applied a total of 0 rules in 18 ms. Remains 931 /931 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1053 ms. Remains : 931/1002 places, 1168/1267 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-13 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (EQ s594 1) (EQ s657 1)), p1:(NEQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-13 finished in 1246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 4 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 982 transition count 1244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 982 transition count 1244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 982 transition count 1243
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 969 transition count 1225
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 969 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 969 transition count 1223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 959 transition count 1209
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 959 transition count 1209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 959 transition count 1208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 950 transition count 1197
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 950 transition count 1197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 111 place count 950 transition count 1194
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 946 transition count 1190
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 946 transition count 1190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 946 transition count 1188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 123 place count 944 transition count 1186
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 944 transition count 1186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 944 transition count 1184
Applied a total of 127 rules in 143 ms. Remains 944 /1002 variables (removed 58) and now considering 1184/1267 (removed 83) transitions.
// Phase 1: matrix 1184 rows 944 cols
[2024-05-26 02:25:39] [INFO ] Computed 42 invariants in 13 ms
[2024-05-26 02:25:39] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-26 02:25:39] [INFO ] Invariant cache hit.
[2024-05-26 02:25:40] [INFO ] Implicit Places using invariants and state equation in 689 ms returned [137, 246, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 943 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 941/1002 places, 1184/1267 transitions.
Applied a total of 0 rules in 28 ms. Remains 941 /941 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1114 ms. Remains : 941/1002 places, 1184/1267 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s648 1), p1:(OR (AND (EQ s882 1) (EQ s921 1)) (EQ s519 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-14 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||X(F(p0)))))'
Support contains 4 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 981 transition count 1243
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 981 transition count 1243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 981 transition count 1242
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 966 transition count 1220
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 966 transition count 1220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 966 transition count 1218
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 87 place count 954 transition count 1202
Iterating global reduction 2 with 12 rules applied. Total rules applied 99 place count 954 transition count 1202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 954 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 111 place count 944 transition count 1188
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 944 transition count 1188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 125 place count 944 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 940 transition count 1180
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 940 transition count 1180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 940 transition count 1178
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 137 place count 938 transition count 1176
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 938 transition count 1176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 141 place count 938 transition count 1174
Applied a total of 141 rules in 133 ms. Remains 938 /1002 variables (removed 64) and now considering 1174/1267 (removed 93) transitions.
// Phase 1: matrix 1174 rows 938 cols
[2024-05-26 02:25:40] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:25:40] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-26 02:25:40] [INFO ] Invariant cache hit.
[2024-05-26 02:25:41] [INFO ] Implicit Places using invariants and state equation in 724 ms returned [137, 431]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 980 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/1002 places, 1174/1267 transitions.
Applied a total of 0 rules in 16 ms. Remains 936 /936 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1129 ms. Remains : 936/1002 places, 1174/1267 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s125 1) (EQ s213 1)), p1:(AND (EQ s246 1) (EQ s285 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]]
Stuttering criterion allowed to conclude after 538 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-15 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : NoC3x3-PT-3B-LTLFireability-06
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1002/1002 places, 1267/1267 transitions.
Graph (trivial) has 815 edges and 1002 vertex of which 72 / 1002 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 938 transition count 1071
Reduce places removed 132 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 806 transition count 1070
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 805 transition count 1070
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 267 place count 805 transition count 992
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 423 place count 727 transition count 992
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 462 place count 688 transition count 919
Iterating global reduction 3 with 39 rules applied. Total rules applied 501 place count 688 transition count 919
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 506 place count 688 transition count 914
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 509 place count 685 transition count 914
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 509 place count 685 transition count 913
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 511 place count 684 transition count 913
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 524 place count 671 transition count 890
Iterating global reduction 5 with 13 rules applied. Total rules applied 537 place count 671 transition count 890
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 541 place count 671 transition count 886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 543 place count 669 transition count 886
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 551 place count 661 transition count 877
Iterating global reduction 7 with 8 rules applied. Total rules applied 559 place count 661 transition count 877
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 564 place count 661 transition count 872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 565 place count 660 transition count 872
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 568 place count 657 transition count 867
Iterating global reduction 9 with 3 rules applied. Total rules applied 571 place count 657 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 572 place count 657 transition count 866
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 574 place count 655 transition count 864
Iterating global reduction 10 with 2 rules applied. Total rules applied 576 place count 655 transition count 864
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 578 place count 655 transition count 862
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 11 with 684 rules applied. Total rules applied 1262 place count 313 transition count 520
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 1277 place count 298 transition count 492
Iterating global reduction 11 with 15 rules applied. Total rules applied 1292 place count 298 transition count 492
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1296 place count 298 transition count 488
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1299 place count 295 transition count 482
Iterating global reduction 12 with 3 rules applied. Total rules applied 1302 place count 295 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1303 place count 295 transition count 481
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1305 place count 293 transition count 477
Iterating global reduction 13 with 2 rules applied. Total rules applied 1307 place count 293 transition count 477
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 26 rules applied. Total rules applied 1333 place count 280 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1334 place count 279 transition count 475
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1340 place count 273 transition count 475
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1374 place count 256 transition count 458
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1391 place count 256 transition count 441
Applied a total of 1391 rules in 176 ms. Remains 256 /1002 variables (removed 746) and now considering 441/1267 (removed 826) transitions.
[2024-05-26 02:25:41] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
// Phase 1: matrix 433 rows 256 cols
[2024-05-26 02:25:41] [INFO ] Computed 36 invariants in 7 ms
[2024-05-26 02:25:41] [INFO ] Implicit Places using invariants in 140 ms returned [8, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 254/1002 places, 441/1267 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 249 transition count 436
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 249 transition count 431
Applied a total of 15 rules in 6 ms. Remains 249 /254 variables (removed 5) and now considering 431/441 (removed 10) transitions.
[2024-05-26 02:25:42] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
// Phase 1: matrix 423 rows 249 cols
[2024-05-26 02:25:42] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:25:42] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-26 02:25:42] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2024-05-26 02:25:42] [INFO ] Invariant cache hit.
[2024-05-26 02:25:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:25:42] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [23, 59, 113]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 412 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 246/1002 places, 431/1267 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 243 transition count 428
Applied a total of 6 rules in 5 ms. Remains 243 /246 variables (removed 3) and now considering 428/431 (removed 3) transitions.
[2024-05-26 02:25:42] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 243 cols
[2024-05-26 02:25:42] [INFO ] Computed 34 invariants in 2 ms
[2024-05-26 02:25:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-26 02:25:42] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:25:42] [INFO ] Invariant cache hit.
[2024-05-26 02:25:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:25:42] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 243/1002 places, 428/1267 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1222 ms. Remains : 243/1002 places, 428/1267 transitions.
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s65 0), p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1221 reset in 327 ms.
Product exploration explored 100000 steps with 1238 reset in 342 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/243 stabilizing places and 2/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 360 steps, including 4 resets, run visited all 2 properties in 8 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 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 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 428/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-05-26 02:25:44] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:25:44] [INFO ] Invariant cache hit.
[2024-05-26 02:25:44] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-26 02:25:44] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:25:44] [INFO ] Invariant cache hit.
[2024-05-26 02:25:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:25:44] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-26 02:25:44] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 02:25:44] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:25:44] [INFO ] Invariant cache hit.
[2024-05-26 02:25:44] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 243/243 places, 428/428 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/243 stabilizing places and 2/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 208 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 51 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 238 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 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1224 reset in 302 ms.
Product exploration explored 100000 steps with 1229 reset in 319 ms.
Built C files in :
/tmp/ltsmin5485120001052756039
[2024-05-26 02:25:46] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2024-05-26 02:25:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:25:46] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2024-05-26 02:25:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:25:46] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2024-05-26 02:25:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:25:46] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5485120001052756039
Running compilation step : cd /tmp/ltsmin5485120001052756039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 847 ms.
Running link step : cd /tmp/ltsmin5485120001052756039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5485120001052756039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4634664980119346622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 428/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-05-26 02:26:01] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:26:01] [INFO ] Invariant cache hit.
[2024-05-26 02:26:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-26 02:26:01] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:26:01] [INFO ] Invariant cache hit.
[2024-05-26 02:26:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:26:01] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-26 02:26:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 02:26:01] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2024-05-26 02:26:01] [INFO ] Invariant cache hit.
[2024-05-26 02:26:01] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 243/243 places, 428/428 transitions.
Built C files in :
/tmp/ltsmin14941235019345553503
[2024-05-26 02:26:01] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2024-05-26 02:26:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:26:01] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2024-05-26 02:26:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:26:01] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2024-05-26 02:26:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:26:01] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14941235019345553503
Running compilation step : cd /tmp/ltsmin14941235019345553503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 842 ms.
Running link step : cd /tmp/ltsmin14941235019345553503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14941235019345553503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9406101716957985748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:26:16] [INFO ] Flatten gal took : 15 ms
[2024-05-26 02:26:16] [INFO ] Flatten gal took : 14 ms
[2024-05-26 02:26:16] [INFO ] Time to serialize gal into /tmp/LTL6863575418920663262.gal : 4 ms
[2024-05-26 02:26:16] [INFO ] Time to serialize properties into /tmp/LTL4018599527189446283.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6863575418920663262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14196924177834501241.hoa' '-atoms' '/tmp/LTL4018599527189446283.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4018599527189446283.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14196924177834501241.hoa
Detected timeout of ITS tools.
[2024-05-26 02:26:32] [INFO ] Flatten gal took : 15 ms
[2024-05-26 02:26:32] [INFO ] Flatten gal took : 21 ms
[2024-05-26 02:26:32] [INFO ] Time to serialize gal into /tmp/LTL9712529031153627171.gal : 2 ms
[2024-05-26 02:26:32] [INFO ] Time to serialize properties into /tmp/LTL14360002174268001889.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9712529031153627171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14360002174268001889.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p50==0)")))||(G("(p460==0)")))))
Formula 0 simplified : X(GF!"(p50==0)" & F!"(p460==0)")
Detected timeout of ITS tools.
[2024-05-26 02:26:47] [INFO ] Flatten gal took : 18 ms
[2024-05-26 02:26:47] [INFO ] Applying decomposition
[2024-05-26 02:26:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3724905675304781876.txt' '-o' '/tmp/graph3724905675304781876.bin' '-w' '/tmp/graph3724905675304781876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3724905675304781876.bin' '-l' '-1' '-v' '-w' '/tmp/graph3724905675304781876.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:26:47] [INFO ] Decomposing Gal with order
[2024-05-26 02:26:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:26:47] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-26 02:26:47] [INFO ] Flatten gal took : 27 ms
[2024-05-26 02:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 9 ms.
[2024-05-26 02:26:47] [INFO ] Time to serialize gal into /tmp/LTL14105960946806088948.gal : 5 ms
[2024-05-26 02:26:47] [INFO ] Time to serialize properties into /tmp/LTL8572236223783805004.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14105960946806088948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8572236223783805004.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i1.i1.u0.p50==0)")))||(G("(i5.i0.u14.p460==0)")))))
Formula 0 simplified : X(GF!"(i1.i1.u0.p50==0)" & F!"(i5.i0.u14.p460==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8030430267617289566
[2024-05-26 02:27:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8030430267617289566
Running compilation step : cd /tmp/ltsmin8030430267617289566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 614 ms.
Running link step : cd /tmp/ltsmin8030430267617289566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8030430267617289566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-3B-LTLFireability-06 finished in 96003 ms.
[2024-05-26 02:27:17] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
[2024-05-26 02:27:17] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin5219714849003331911
[2024-05-26 02:27:17] [INFO ] Computing symmetric may disable matrix : 1267 transitions.
[2024-05-26 02:27:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:27:17] [INFO ] Computing symmetric may enable matrix : 1267 transitions.
[2024-05-26 02:27:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:27:17] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7987290493747090633.txt' '-o' '/tmp/graph7987290493747090633.bin' '-w' '/tmp/graph7987290493747090633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7987290493747090633.bin' '-l' '-1' '-v' '-w' '/tmp/graph7987290493747090633.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:27:17] [INFO ] Decomposing Gal with order
[2024-05-26 02:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:27:17] [INFO ] Computing Do-Not-Accords matrix : 1267 transitions.
[2024-05-26 02:27:17] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:27:17] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5219714849003331911
Running compilation step : cd /tmp/ltsmin5219714849003331911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 02:27:17] [INFO ] Removed a total of 523 redundant transitions.
[2024-05-26 02:27:18] [INFO ] Flatten gal took : 63 ms
[2024-05-26 02:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2024-05-26 02:27:18] [INFO ] Time to serialize gal into /tmp/LTLFireability10976394386400807442.gal : 13 ms
[2024-05-26 02:27:18] [INFO ] Time to serialize properties into /tmp/LTLFireability9686926867812030551.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10976394386400807442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9686926867812030551.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i4.i1.i0.u22.p50==0)")))||(G("(i4.i0.i0.u111.p460==0)")))))
Formula 0 simplified : X(GF!"(i4.i1.i0.u22.p50==0)" & F!"(i4.i0.i0.u111.p460==0)")
Compilation finished in 3947 ms.
Running link step : cd /tmp/ltsmin5219714849003331911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5219714849003331911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 02:48:38] [INFO ] Applying decomposition
[2024-05-26 02:48:38] [INFO ] Flatten gal took : 74 ms
[2024-05-26 02:48:38] [INFO ] Decomposing Gal with order
[2024-05-26 02:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:48:38] [INFO ] Removed a total of 282 redundant transitions.
[2024-05-26 02:48:38] [INFO ] Flatten gal took : 141 ms
[2024-05-26 02:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 243 ms.
[2024-05-26 02:48:39] [INFO ] Time to serialize gal into /tmp/LTLFireability7898346610078053131.gal : 24 ms
[2024-05-26 02:48:39] [INFO ] Time to serialize properties into /tmp/LTLFireability2709112468581830872.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7898346610078053131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2709112468581830872.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...365
Formula 0 simplified : X(GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...355
Detected timeout of ITS tools.
[2024-05-26 03:10:00] [INFO ] Flatten gal took : 426 ms
[2024-05-26 03:10:02] [INFO ] Input system was already deterministic with 1267 transitions.
[2024-05-26 03:10:03] [INFO ] Transformed 1002 places.
[2024-05-26 03:10:03] [INFO ] Transformed 1267 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 03:10:03] [INFO ] Time to serialize gal into /tmp/LTLFireability6226885329702176309.gal : 26 ms
[2024-05-26 03:10:03] [INFO ] Time to serialize properties into /tmp/LTLFireability17773023666077551150.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6226885329702176309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17773023666077551150.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F(G("(p50==0)")))||(G("(p460==0)")))))
Formula 0 simplified : X(GF!"(p50==0)" & F!"(p460==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7608472 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16205072 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-3B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372700373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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