Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100199.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-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 581K 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-3B-ReachabilityFireability-2025-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748821877250

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-01 23:51:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 23:51:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 23:51:18] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-01 23:51:18] [INFO ] Transformed 2117 places.
[2025-06-01 23:51:18] [INFO ] Transformed 2435 transitions.
[2025-06-01 23:51:18] [INFO ] Found NUPN structural information;
[2025-06-01 23:51:18] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1779 ms. (22 steps per ms) remains 5/16 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-01 23:51:19] [INFO ] Flatten gal took : 302 ms
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 5/5 properties
[2025-06-01 23:51:19] [INFO ] Flatten gal took : 161 ms
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
[2025-06-01 23:51:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13005906282778362588.gal : 79 ms
[2025-06-01 23:51:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6418902241023490320.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13005906282778362588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6418902241023490320.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2435 rows 2117 cols
[2025-06-01 23:51:19] [INFO ] Computed 66 invariants in 35 ms
Loading property file /tmp/ReachabilityCardinality6418902241023490320.prop.
Excessive predecessor constraint size, skipping predecessor.
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/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-3B-ReachabilityFireability-2025-06 is UNSAT
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2027/2117 variables, 66/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2117 variables, 2027/2183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 7 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2672 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :66 after 509
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :509 after 684
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :684 after 1971
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1971 after 8420
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :8420 after 475439
At refinement iteration 2 (OVERLAPS) 1883/1966 variables, 56/139 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :475439 after 2.27753e+08
SDD proceeding with computation,5 properties remain. new max is 8192
At refinement iteration 3 (INCLUDED_ONLY) 0/1966 variables, 1883/2022 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD size :2.27753e+08 after 3.89501e+09
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :3.89501e+09 after 1.62956e+10
[2025-06-01 23:51:25] [INFO ] Deduced a trap composed of 34 places in 558 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:25] [INFO ] Deduced a trap composed of 53 places in 477 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:25] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:26] [INFO ] Deduced a trap composed of 56 places in 561 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :1.62956e+10 after 1.61883e+11
[2025-06-01 23:51:27] [INFO ] Deduced a trap composed of 57 places in 502 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:27] [INFO ] Deduced a trap composed of 64 places in 518 ms of which 125 ms to minimize.
SMT process timed out in 8692ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 83 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1568 edges and 2117 vertex of which 48 / 2117 are part of one of the 6 SCC in 15 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 2070 transition count 1986
Reduce places removed 401 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 1669 transition count 1980
Reduce places removed 3 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 34 rules applied. Total rules applied 848 place count 1666 transition count 1949
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 879 place count 1635 transition count 1949
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 879 place count 1635 transition count 1927
Deduced a syphon composed of 22 places in 16 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 923 place count 1613 transition count 1927
Discarding 354 places :
Symmetric choice reduction at 4 with 354 rule applications. Total rules 1277 place count 1259 transition count 1573
Iterating global reduction 4 with 354 rules applied. Total rules applied 1631 place count 1259 transition count 1573
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 1631 place count 1259 transition count 1546
Deduced a syphon composed of 27 places in 12 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1685 place count 1232 transition count 1546
Discarding 122 places :
Symmetric choice reduction at 4 with 122 rule applications. Total rules 1807 place count 1110 transition count 1400
Iterating global reduction 4 with 122 rules applied. Total rules applied 1929 place count 1110 transition count 1400
Discarding 118 places :
Symmetric choice reduction at 4 with 118 rule applications. Total rules 2047 place count 992 transition count 1269
Iterating global reduction 4 with 118 rules applied. Total rules applied 2165 place count 992 transition count 1269
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2207 place count 950 transition count 1196
Iterating global reduction 4 with 42 rules applied. Total rules applied 2249 place count 950 transition count 1196
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 16 rules applied. Total rules applied 2265 place count 948 transition count 1182
SDD proceeding with computation,5 properties remain. new max is 65536
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2267 place count 946 transition count 1182
SDD size :1.61883e+11 after 3.62379e+14
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 2297 place count 916 transition count 1152
Iterating global reduction 6 with 30 rules applied. Total rules applied 2327 place count 916 transition count 1152
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2335 place count 912 transition count 1148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2339 place count 908 transition count 1148
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 2353 place count 894 transition count 1120
Iterating global reduction 8 with 14 rules applied. Total rules applied 2367 place count 894 transition count 1120
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 2380 place count 881 transition count 1107
Iterating global reduction 8 with 13 rules applied. Total rules applied 2393 place count 881 transition count 1107
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 15 rules applied. Total rules applied 2408 place count 879 transition count 1094
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2410 place count 877 transition count 1094
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 10 with 586 rules applied. Total rules applied 2996 place count 584 transition count 801
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 3014 place count 566 transition count 777
Iterating global reduction 10 with 18 rules applied. Total rules applied 3032 place count 566 transition count 777
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 3040 place count 558 transition count 761
Iterating global reduction 10 with 8 rules applied. Total rules applied 3048 place count 558 transition count 761
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3050 place count 558 transition count 759
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3051 place count 557 transition count 757
Iterating global reduction 11 with 1 rules applied. Total rules applied 3052 place count 557 transition count 757
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3056 place count 555 transition count 755
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 3088 place count 539 transition count 796
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 3090 place count 539 transition count 794
Free-agglomeration rule applied 42 times.
Iterating global reduction 11 with 42 rules applied. Total rules applied 3132 place count 539 transition count 752
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 50 rules applied. Total rules applied 3182 place count 497 transition count 744
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 3189 place count 497 transition count 737
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 3192 place count 497 transition count 734
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3195 place count 494 transition count 734
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 3204 place count 494 transition count 734
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 3210 place count 494 transition count 734
Applied a total of 3210 rules in 1086 ms. Remains 494 /2117 variables (removed 1623) and now considering 734/2435 (removed 1701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 494/2117 places, 734/2435 transitions.
RANDOM walk for 40000 steps (314 resets) in 677 ms. (58 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (31 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (33 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
// Phase 1: matrix 734 rows 494 cols
[2025-06-01 23:51:30] [INFO ] Computed 55 invariants in 8 ms
[2025-06-01 23:51:30] [INFO ] State equation strengthened by 63 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 368/431 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/448 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 726/1174 variables, 448/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1174 variables, 55/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1174 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 54/1228 variables, 46/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1228 variables, 8/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1228 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1228 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1228/1228 variables, and 612 constraints, problems are : Problem set: 0 solved, 2 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 494/494 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/1 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 368/431 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:30] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/448 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:31] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 726/1174 variables, 448/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1174 variables, 55/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1174 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/1228 variables, 46/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1228 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1228 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1228 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1228 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1228/1228 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 494/494 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2582ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 228 ms.
Support contains 14 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 734/734 transitions.
Graph (trivial) has 131 edges and 494 vertex of which 6 / 494 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 491 transition count 716
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 479 transition count 716
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 479 transition count 703
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 466 transition count 703
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 457 transition count 681
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 457 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 457 transition count 680
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 455 transition count 676
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 455 transition count 676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 455 transition count 674
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 158 place count 414 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 414 transition count 632
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 176 place count 397 transition count 607
Iterating global reduction 5 with 17 rules applied. Total rules applied 193 place count 397 transition count 607
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 197 place count 397 transition count 603
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 202 place count 392 transition count 593
Iterating global reduction 6 with 5 rules applied. Total rules applied 207 place count 392 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 210 place count 392 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 211 place count 391 transition count 588
Iterating global reduction 7 with 1 rules applied. Total rules applied 212 place count 391 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 213 place count 391 transition count 587
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 225 place count 385 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 227 place count 383 transition count 591
Iterating global reduction 8 with 2 rules applied. Total rules applied 229 place count 383 transition count 591
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 230 place count 382 transition count 587
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 382 transition count 587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 232 place count 381 transition count 585
Iterating global reduction 8 with 1 rules applied. Total rules applied 233 place count 381 transition count 585
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 238 place count 381 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 239 place count 381 transition count 579
Free-agglomeration rule applied 14 times.
Iterating global reduction 9 with 14 rules applied. Total rules applied 253 place count 381 transition count 565
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 280 place count 367 transition count 552
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 281 place count 366 transition count 548
Iterating global reduction 10 with 1 rules applied. Total rules applied 282 place count 366 transition count 548
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 287 place count 366 transition count 548
Applied a total of 287 rules in 153 ms. Remains 366 /494 variables (removed 128) and now considering 548/734 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 366/494 places, 548/734 transitions.
RANDOM walk for 40000 steps (493 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (29 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :3.62379e+14 after 6.56031e+15
Interrupted probabilistic random walk after 658172 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 658172 steps, saw 129174 distinct states, run finished after 3005 ms. (steps per millisecond=219 ) properties seen :0
// Phase 1: matrix 548 rows 366 cols
[2025-06-01 23:51:36] [INFO ] Computed 55 invariants in 7 ms
[2025-06-01 23:51:36] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/320 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 536/856 variables, 320/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/856 variables, 61/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/856 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/914 variables, 46/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 12/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/914 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/914 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 366/366 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/320 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:36] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:37] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:37] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:51:37] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 536/856 variables, 320/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/856 variables, 61/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/914 variables, 46/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 12/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/914 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/914 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/914 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 914/914 variables, and 506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 366/366 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7442 steps, including 103 resets, run visited all 1 properties in 50 ms. (steps per millisecond=148 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2025-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 55 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 19180 ms.

BK_STOP 1748821897621

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityFireability"
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-3B, examination is ReachabilityFireability"
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-174876812100199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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