Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NoC3x3-PT-2B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 548K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748817597910

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 22:39:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 22:39:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:39:59] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-01 22:39:59] [INFO ] Transformed 2003 places.
[2025-06-01 22:39:59] [INFO ] Transformed 2292 transitions.
[2025-06-01 22:39:59] [INFO ] Found NUPN structural information;
[2025-06-01 22:39:59] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-2B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1994 transition count 2292
Discarding 503 places :
Symmetric choice reduction at 1 with 503 rule applications. Total rules 512 place count 1491 transition count 1789
Iterating global reduction 1 with 503 rules applied. Total rules applied 1015 place count 1491 transition count 1789
Discarding 173 places :
Symmetric choice reduction at 1 with 173 rule applications. Total rules 1188 place count 1318 transition count 1616
Iterating global reduction 1 with 173 rules applied. Total rules applied 1361 place count 1318 transition count 1616
Discarding 181 places :
Symmetric choice reduction at 1 with 181 rule applications. Total rules 1542 place count 1137 transition count 1422
Iterating global reduction 1 with 181 rules applied. Total rules applied 1723 place count 1137 transition count 1422
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 1770 place count 1090 transition count 1333
Iterating global reduction 1 with 47 rules applied. Total rules applied 1817 place count 1090 transition count 1333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 15 rules applied. Total rules applied 1832 place count 1088 transition count 1320
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 1866 place count 1054 transition count 1286
Iterating global reduction 2 with 34 rules applied. Total rules applied 1900 place count 1054 transition count 1286
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 1902 place count 1052 transition count 1286
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1924 place count 1030 transition count 1242
Iterating global reduction 3 with 22 rules applied. Total rules applied 1946 place count 1030 transition count 1242
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1968 place count 1008 transition count 1220
Iterating global reduction 3 with 22 rules applied. Total rules applied 1990 place count 1008 transition count 1220
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 1993 place count 1005 transition count 1220
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2014 place count 984 transition count 1199
Iterating global reduction 4 with 21 rules applied. Total rules applied 2035 place count 984 transition count 1199
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2056 place count 984 transition count 1178
Applied a total of 2056 rules in 729 ms. Remains 984 /2003 variables (removed 1019) and now considering 1178/2292 (removed 1114) transitions.
// Phase 1: matrix 1178 rows 984 cols
[2025-06-01 22:40:00] [INFO ] Computed 53 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:01] [INFO ] Implicit Places using invariants in 686 ms returned []
[2025-06-01 22:40:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:02] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned [72, 80, 134, 137, 141, 142, 150, 153, 247, 251, 252, 304, 305, 316, 319, 324, 416, 417, 418, 419, 423, 424, 425, 434, 437, 440, 448, 451, 454, 626, 627, 631, 632, 633, 637, 638, 639, 741, 749, 798, 799, 800, 806, 816, 819, 925, 926, 930, 931]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1860 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/2003 places, 1178/2292 transitions.
Applied a total of 0 rules in 19 ms. Remains 935 /935 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2630 ms. Remains : 935/2003 places, 1178/2292 transitions.
Support contains 24 out of 935 places after structural reductions.
[2025-06-01 22:40:02] [INFO ] Flatten gal took : 101 ms
[2025-06-01 22:40:02] [INFO ] Flatten gal took : 56 ms
[2025-06-01 22:40:02] [INFO ] Input system was already deterministic with 1178 transitions.
RANDOM walk for 40000 steps (64 resets) in 1588 ms. (25 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
// Phase 1: matrix 1178 rows 935 cols
[2025-06-01 22:40:03] [INFO ] Computed 42 invariants in 8 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/794 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1121/1915 variables, 794/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1915 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 198/2113 variables, 141/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2113 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2113 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2113/2113 variables, and 977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 935/935 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/794 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1121/1915 variables, 794/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1915 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 198/2113 variables, 141/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2113 variables, 3/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2113 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2113 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2113/2113 variables, and 980 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 935/935 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2302ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1533 ms.
Support contains 4 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Graph (trivial) has 746 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 3 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 872 transition count 1003
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 106 rules applied. Total rules applied 210 place count 769 transition count 1000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 767 transition count 1000
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 212 place count 767 transition count 914
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 384 place count 681 transition count 914
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 411 place count 654 transition count 854
Iterating global reduction 3 with 27 rules applied. Total rules applied 438 place count 654 transition count 854
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 439 place count 654 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 440 place count 653 transition count 853
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 440 place count 653 transition count 852
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 442 place count 652 transition count 852
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 445 place count 649 transition count 849
Iterating global reduction 5 with 3 rules applied. Total rules applied 448 place count 649 transition count 849
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 450 place count 649 transition count 847
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 6 with 678 rules applied. Total rules applied 1128 place count 310 transition count 508
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1138 place count 300 transition count 490
Iterating global reduction 6 with 10 rules applied. Total rules applied 1148 place count 300 transition count 490
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1151 place count 297 transition count 484
Iterating global reduction 6 with 3 rules applied. Total rules applied 1154 place count 297 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1155 place count 297 transition count 483
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1157 place count 295 transition count 479
Iterating global reduction 7 with 2 rules applied. Total rules applied 1159 place count 295 transition count 479
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 7 with 36 rules applied. Total rules applied 1195 place count 277 transition count 520
Free-agglomeration rule applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1218 place count 277 transition count 497
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1247 place count 254 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1248 place count 254 transition count 490
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 8 with 43 rules applied. Total rules applied 1291 place count 254 transition count 457
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 52 rules applied. Total rules applied 1343 place count 211 transition count 448
Applied a total of 1343 rules in 253 ms. Remains 211 /935 variables (removed 724) and now considering 448/1178 (removed 730) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 211/935 places, 448/1178 transitions.
RANDOM walk for 40000 steps (556 resets) in 522 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 934296 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :0 out of 2
Probabilistic random walk after 934296 steps, saw 127369 distinct states, run finished after 3006 ms. (steps per millisecond=310 ) properties seen :0
[2025-06-01 22:40:11] [INFO ] Flow matrix only has 442 transitions (discarded 6 similar events)
// Phase 1: matrix 442 rows 211 cols
[2025-06-01 22:40:11] [INFO ] Computed 42 invariants in 3 ms
[2025-06-01 22:40:11] [INFO ] State equation strengthened by 138 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 136/149 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 352/501 variables, 149/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 152/653 variables, 62/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 114/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 211/211 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 136/149 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 352/501 variables, 149/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 152/653 variables, 62/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 114/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/653 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 211/211 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 97 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 4 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U p2)&&F(p3))))'
Support contains 7 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 927 transition count 1169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 927 transition count 1169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 927 transition count 1168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 924 transition count 1164
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 924 transition count 1164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 924 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 923 transition count 1162
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 923 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 922 transition count 1160
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 922 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 921 transition count 1159
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 921 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 920 transition count 1158
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 920 transition count 1158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 920 transition count 1157
Applied a total of 33 rules in 155 ms. Remains 920 /935 variables (removed 15) and now considering 1157/1178 (removed 21) transitions.
// Phase 1: matrix 1157 rows 920 cols
[2025-06-01 22:40:12] [INFO ] Computed 42 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:12] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-01 22:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:13] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 1156 sub problems to find dead transitions.
[2025-06-01 22:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/919 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1156 unsolved
SMT process timed out in 30248ms, After SMT, problems are : Problem set: 0 solved, 1156 unsolved
Search for dead transitions found 0 dead transitions in 30255ms
Starting structural reductions in LTL mode, iteration 1 : 920/935 places, 1157/1178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31454 ms. Remains : 920/935 places, 1157/1178 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 21884 steps with 36 reset in 109 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-01 finished in 32008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(p1)||X(p0))) U X(!p2)))'
Support contains 5 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 926 transition count 1167
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 926 transition count 1167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 921 transition count 1161
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 921 transition count 1161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 921 transition count 1160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 916 transition count 1155
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 916 transition count 1155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 916 transition count 1154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 914 transition count 1150
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 914 transition count 1150
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 912 transition count 1148
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 912 transition count 1148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 910 transition count 1145
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 910 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 910 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 909 transition count 1143
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 909 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 908 transition count 1142
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 908 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 908 transition count 1141
Applied a total of 58 rules in 209 ms. Remains 908 /935 variables (removed 27) and now considering 1141/1178 (removed 37) transitions.
// Phase 1: matrix 1141 rows 908 cols
[2025-06-01 22:40:44] [INFO ] Computed 42 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:44] [INFO ] Implicit Places using invariants in 354 ms returned []
[2025-06-01 22:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:40:45] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-06-01 22:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/907 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 908/935 places, 1141/1178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31537 ms. Remains : 908/935 places, 1141/1178 transitions.
Stuttering acceptance computed with spot in 233 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-02
Product exploration explored 100000 steps with 33369 reset in 260 ms.
Product exploration explored 100000 steps with 33412 reset in 354 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/908 stabilizing places and 66/1141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 195 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 35528 steps (54 resets) in 241 ms. (146 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) p1))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 13 factoid took 475 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
[2025-06-01 22:41:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:41:18] [INFO ] [Real]Absence check using 42 positive place invariants in 108 ms returned sat
[2025-06-01 22:41:27] [INFO ] [Real]Absence check using state equation in 8722 ms returned sat
[2025-06-01 22:41:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:41:27] [INFO ] [Nat]Absence check using 42 positive place invariants in 66 ms returned sat
[2025-06-01 22:41:39] [INFO ] [Nat]Absence check using state equation in 12169 ms returned sat
[2025-06-01 22:41:40] [INFO ] Computed and/alt/rep : 1140/2119/1140 causal constraints (skipped 0 transitions) in 53 ms.
[2025-06-01 22:41:42] [INFO ] Added : 80 causal constraints over 16 iterations in 2176 ms. Result :unknown
Could not prove EG p2
Support contains 5 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1141/1141 transitions.
Applied a total of 0 rules in 22 ms. Remains 908 /908 variables (removed 0) and now considering 1141/1141 (removed 0) transitions.
[2025-06-01 22:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:41:42] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-01 22:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:41:43] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-06-01 22:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/907 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 30155ms
Finished structural reductions in LTL mode , in 1 iterations and 31181 ms. Remains : 908/908 places, 1141/1141 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/908 stabilizing places and 66/1141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 148 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 38788 steps (60 resets) in 125 ms. (307 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) p1))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 12 factoid took 436 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
[2025-06-01 22:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:15] [INFO ] [Real]Absence check using 42 positive place invariants in 104 ms returned sat
[2025-06-01 22:42:23] [INFO ] [Real]Absence check using state equation in 8783 ms returned sat
[2025-06-01 22:42:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:24] [INFO ] [Nat]Absence check using 42 positive place invariants in 68 ms returned sat
[2025-06-01 22:42:36] [INFO ] [Nat]Absence check using state equation in 12248 ms returned sat
[2025-06-01 22:42:36] [INFO ] Computed and/alt/rep : 1140/2119/1140 causal constraints (skipped 0 transitions) in 57 ms.
[2025-06-01 22:42:38] [INFO ] Added : 85 causal constraints over 17 iterations in 2320 ms. Result :unknown
Could not prove EG p2
Stuttering acceptance computed with spot in 242 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25035 reset in 185 ms.
Product exploration explored 100000 steps with 25048 reset in 209 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 246 ms :[p2, (AND (NOT p1) (NOT p0) p2), p2, false, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 908/908 places, 1141/1141 transitions.
Graph (trivial) has 721 edges and 908 vertex of which 72 / 908 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.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 845 transition count 1078
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 96 place count 845 transition count 1120
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 142 place count 845 transition count 1120
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 161 place count 826 transition count 1076
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 180 place count 826 transition count 1076
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 180 place count 826 transition count 1082
Deduced a syphon composed of 144 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 183 place count 826 transition count 1082
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 202 place count 807 transition count 1035
Deduced a syphon composed of 125 places in 2 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 221 place count 807 transition count 1035
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 221 place count 807 transition count 1041
Deduced a syphon composed of 131 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 227 place count 807 transition count 1041
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: -202
Deduced a syphon composed of 476 places in 0 ms
Iterating global reduction 1 with 345 rules applied. Total rules applied 572 place count 807 transition count 1243
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 628 place count 751 transition count 1161
Deduced a syphon composed of 432 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 684 place count 751 transition count 1161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 689 place count 746 transition count 1154
Deduced a syphon composed of 429 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 694 place count 746 transition count 1154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 696 place count 744 transition count 1149
Deduced a syphon composed of 429 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 698 place count 744 transition count 1149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 430 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 699 place count 744 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 700 place count 743 transition count 1148
Deduced a syphon composed of 429 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 701 place count 743 transition count 1148
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -218
Deduced a syphon composed of 462 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 734 place count 743 transition count 1366
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 755 place count 722 transition count 1277
Deduced a syphon composed of 441 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 776 place count 722 transition count 1277
Deduced a syphon composed of 441 places in 1 ms
Applied a total of 776 rules in 368 ms. Remains 722 /908 variables (removed 186) and now considering 1277/1141 (removed -136) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:42:40] [INFO ] Redundant transitions in 91 ms returned []
Running 1276 sub problems to find dead transitions.
[2025-06-01 22:42:40] [INFO ] Flow matrix only has 1269 transitions (discarded 8 similar events)
// Phase 1: matrix 1269 rows 722 cols
[2025-06-01 22:42:40] [INFO ] Computed 42 invariants in 7 ms
[2025-06-01 22:42:40] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/721 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
SMT process timed out in 30455ms, After SMT, problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 30459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 722/908 places, 1277/1141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30927 ms. Remains : 722/908 places, 1277/1141 transitions.
Built C files in :
/tmp/ltsmin12374670418502867684
[2025-06-01 22:43:10] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12374670418502867684
Running compilation step : cd /tmp/ltsmin12374670418502867684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1844 ms.
Running link step : cd /tmp/ltsmin12374670418502867684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12374670418502867684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1002233686284585595.hoa' '--buchi-type=spotba'
LTSmin run took 1202 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-2B-LTLCardinality-02 finished in 150120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Graph (trivial) has 748 edges and 935 vertex of which 72 / 935 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 (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 871 transition count 1011
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 768 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 767 transition count 1009
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 210 place count 767 transition count 932
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 364 place count 690 transition count 932
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 393 place count 661 transition count 870
Iterating global reduction 3 with 29 rules applied. Total rules applied 422 place count 661 transition count 870
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 661 transition count 869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 424 place count 660 transition count 869
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 424 place count 660 transition count 866
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 430 place count 657 transition count 866
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 435 place count 652 transition count 858
Iterating global reduction 5 with 5 rules applied. Total rules applied 440 place count 652 transition count 858
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 442 place count 652 transition count 856
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 6 with 692 rules applied. Total rules applied 1134 place count 306 transition count 510
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1143 place count 297 transition count 494
Iterating global reduction 6 with 9 rules applied. Total rules applied 1152 place count 297 transition count 494
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1155 place count 294 transition count 488
Iterating global reduction 6 with 3 rules applied. Total rules applied 1158 place count 294 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1159 place count 294 transition count 487
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1161 place count 292 transition count 483
Iterating global reduction 7 with 2 rules applied. Total rules applied 1163 place count 292 transition count 483
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 7 with 26 rules applied. Total rules applied 1189 place count 279 transition count 482
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1190 place count 279 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1191 place count 278 transition count 481
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1200 place count 269 transition count 481
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 8 with 48 rules applied. Total rules applied 1248 place count 245 transition count 457
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1268 place count 245 transition count 437
Applied a total of 1268 rules in 145 ms. Remains 245 /935 variables (removed 690) and now considering 437/1178 (removed 741) transitions.
[2025-06-01 22:43:14] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
// Phase 1: matrix 429 rows 245 cols
[2025-06-01 22:43:14] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:43:14] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-06-01 22:43:14] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
[2025-06-01 22:43:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:43:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 22:43:14] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:43:14] [INFO ] Redundant transitions in 3 ms returned []
Running 397 sub problems to find dead transitions.
[2025-06-01 22:43:14] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
[2025-06-01 22:43:14] [INFO ] Invariant cache hit.
[2025-06-01 22:43:14] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 9/245 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 428/673 variables, 245/278 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 24/302 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (OVERLAPS) 0/673 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/674 variables, and 302 constraints, problems are : Problem set: 0 solved, 397 unsolved in 24203 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 245/245 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 9/245 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 428/673 variables, 245/278 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 24/302 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 397/699 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/674 variables, and 699 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 245/245 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54285ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 54286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 245/935 places, 437/1178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55097 ms. Remains : 245/935 places, 437/1178 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-04
Stuttering criterion allowed to conclude after 2491 steps with 30 reset in 18 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-04 finished in 55211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Graph (trivial) has 750 edges and 935 vertex of which 72 / 935 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 (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 871 transition count 1009
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 766 transition count 1008
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 212 place count 766 transition count 931
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 366 place count 689 transition count 931
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 394 place count 661 transition count 871
Iterating global reduction 2 with 28 rules applied. Total rules applied 422 place count 661 transition count 871
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 422 place count 661 transition count 868
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 658 transition count 868
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 432 place count 654 transition count 861
Iterating global reduction 2 with 4 rules applied. Total rules applied 436 place count 654 transition count 861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 437 place count 654 transition count 860
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 3 with 698 rules applied. Total rules applied 1135 place count 305 transition count 511
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1146 place count 294 transition count 491
Iterating global reduction 3 with 11 rules applied. Total rules applied 1157 place count 294 transition count 491
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 290 transition count 483
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 290 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 1167 place count 290 transition count 481
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1169 place count 288 transition count 477
Iterating global reduction 4 with 2 rules applied. Total rules applied 1171 place count 288 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 4 with 26 rules applied. Total rules applied 1197 place count 275 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1198 place count 274 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1207 place count 265 transition count 475
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 5 with 48 rules applied. Total rules applied 1255 place count 241 transition count 451
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1275 place count 241 transition count 431
Applied a total of 1275 rules in 190 ms. Remains 241 /935 variables (removed 694) and now considering 431/1178 (removed 747) transitions.
[2025-06-01 22:44:09] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
// Phase 1: matrix 423 rows 241 cols
[2025-06-01 22:44:09] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:09] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-01 22:44:09] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2025-06-01 22:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 22:44:10] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:44:10] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 22:44:10] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2025-06-01 22:44:10] [INFO ] Invariant cache hit.
[2025-06-01 22:44:10] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 9/241 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 422/663 variables, 241/274 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 24/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/663 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/664 variables, and 298 constraints, problems are : Problem set: 0 solved, 391 unsolved in 22892 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 241/241 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 9/241 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 422/663 variables, 241/274 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 24/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 391/689 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 689 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 241/241 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52953ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 52954ms
Starting structural reductions in SI_LTL mode, iteration 1 : 241/935 places, 431/1178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53731 ms. Remains : 241/935 places, 431/1178 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-08
Stuttering criterion allowed to conclude after 2957 steps with 40 reset in 14 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-08 finished in 53797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Graph (trivial) has 750 edges and 935 vertex of which 72 / 935 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 (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 871 transition count 1010
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 767 transition count 1009
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 210 place count 767 transition count 932
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 364 place count 690 transition count 932
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 392 place count 662 transition count 871
Iterating global reduction 2 with 28 rules applied. Total rules applied 420 place count 662 transition count 871
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 662 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 661 transition count 870
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 422 place count 661 transition count 867
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 428 place count 658 transition count 867
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 432 place count 654 transition count 860
Iterating global reduction 4 with 4 rules applied. Total rules applied 436 place count 654 transition count 860
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 438 place count 654 transition count 858
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 1 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 5 with 694 rules applied. Total rules applied 1132 place count 307 transition count 511
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1143 place count 296 transition count 491
Iterating global reduction 5 with 11 rules applied. Total rules applied 1154 place count 296 transition count 491
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1158 place count 292 transition count 483
Iterating global reduction 5 with 4 rules applied. Total rules applied 1162 place count 292 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1164 place count 292 transition count 481
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1166 place count 290 transition count 477
Iterating global reduction 6 with 2 rules applied. Total rules applied 1168 place count 290 transition count 477
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 6 with 28 rules applied. Total rules applied 1196 place count 276 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1197 place count 275 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1206 place count 266 transition count 475
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 7 with 48 rules applied. Total rules applied 1254 place count 242 transition count 451
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1274 place count 242 transition count 431
Applied a total of 1274 rules in 104 ms. Remains 242 /935 variables (removed 693) and now considering 431/1178 (removed 747) transitions.
[2025-06-01 22:45:03] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
// Phase 1: matrix 423 rows 242 cols
[2025-06-01 22:45:03] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:03] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-01 22:45:03] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2025-06-01 22:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 22:45:03] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:45:03] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 22:45:03] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2025-06-01 22:45:03] [INFO ] Invariant cache hit.
[2025-06-01 22:45:03] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 9/242 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 422/664 variables, 242/275 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/664 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/665 variables, and 299 constraints, problems are : Problem set: 0 solved, 391 unsolved in 23500 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 242/242 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 9/242 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 422/664 variables, 242/275 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 391/690 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/665 variables, and 690 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 242/242 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53577ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 53578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/935 places, 431/1178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54339 ms. Remains : 242/935 places, 431/1178 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-09
Stuttering criterion allowed to conclude after 1882 steps with 24 reset in 10 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-09 finished in 54428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 923 transition count 1164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 923 transition count 1164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 923 transition count 1163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 918 transition count 1157
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 918 transition count 1157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 918 transition count 1156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 913 transition count 1151
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 913 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 913 transition count 1150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 911 transition count 1146
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 911 transition count 1146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 909 transition count 1144
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 909 transition count 1144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 907 transition count 1141
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 907 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 907 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 906 transition count 1139
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 906 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 905 transition count 1138
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 905 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 905 transition count 1137
Applied a total of 65 rules in 155 ms. Remains 905 /935 variables (removed 30) and now considering 1137/1178 (removed 41) transitions.
// Phase 1: matrix 1137 rows 905 cols
[2025-06-01 22:45:57] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:57] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-01 22:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:58] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1136 sub problems to find dead transitions.
[2025-06-01 22:45:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1136 unsolved
SMT process timed out in 30146ms, After SMT, problems are : Problem set: 0 solved, 1136 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Starting structural reductions in LTL mode, iteration 1 : 905/935 places, 1137/1178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31391 ms. Remains : 905/935 places, 1137/1178 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 218 ms.
Product exploration explored 100000 steps with 33333 reset in 214 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2B-LTLCardinality-10 finished in 31975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1178/1178 transitions.
Graph (trivial) has 752 edges and 935 vertex of which 72 / 935 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 (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 871 transition count 1009
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 766 transition count 1008
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 212 place count 766 transition count 931
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 366 place count 689 transition count 931
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 395 place count 660 transition count 869
Iterating global reduction 2 with 29 rules applied. Total rules applied 424 place count 660 transition count 869
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 425 place count 660 transition count 868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 659 transition count 868
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 426 place count 659 transition count 865
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 432 place count 656 transition count 865
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 437 place count 651 transition count 857
Iterating global reduction 4 with 5 rules applied. Total rules applied 442 place count 651 transition count 857
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 444 place count 651 transition count 855
Performed 348 Post agglomeration using F-continuation condition.Transition count delta: 348
Deduced a syphon composed of 348 places in 0 ms
Reduce places removed 348 places and 0 transitions.
Iterating global reduction 5 with 696 rules applied. Total rules applied 1140 place count 303 transition count 507
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1151 place count 292 transition count 487
Iterating global reduction 5 with 11 rules applied. Total rules applied 1162 place count 292 transition count 487
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1166 place count 288 transition count 479
Iterating global reduction 5 with 4 rules applied. Total rules applied 1170 place count 288 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1172 place count 288 transition count 477
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1174 place count 286 transition count 473
Iterating global reduction 6 with 2 rules applied. Total rules applied 1176 place count 286 transition count 473
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 6 with 26 rules applied. Total rules applied 1202 place count 273 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1203 place count 272 transition count 471
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1212 place count 263 transition count 471
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 1260 place count 239 transition count 447
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1280 place count 239 transition count 427
Applied a total of 1280 rules in 106 ms. Remains 239 /935 variables (removed 696) and now considering 427/1178 (removed 751) transitions.
[2025-06-01 22:46:29] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 239 cols
[2025-06-01 22:46:29] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:46:29] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-01 22:46:29] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2025-06-01 22:46:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:46:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 22:46:29] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:46:29] [INFO ] Redundant transitions in 3 ms returned []
Running 387 sub problems to find dead transitions.
[2025-06-01 22:46:29] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2025-06-01 22:46:29] [INFO ] Invariant cache hit.
[2025-06-01 22:46:29] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 9/239 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 418/657 variables, 239/272 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 24/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (OVERLAPS) 0/657 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/658 variables, and 296 constraints, problems are : Problem set: 0 solved, 387 unsolved in 22896 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 239/239 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 9/239 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 418/657 variables, 239/272 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 24/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 387/683 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 683 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 239/239 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52964ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 52965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/935 places, 427/1178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53452 ms. Remains : 239/935 places, 427/1178 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-14 finished in 53509 ms.
All properties solved by simple procedures.
Total runtime 443854 ms.

BK_STOP 1748818043025

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-2B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;