Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K 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 608K 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-4B-ReachabilityFireability-2025-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748825599113

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-4B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 00:53:20] [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-02 00:53:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 00:53:20] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-02 00:53:20] [INFO ] Transformed 2328 places.
[2025-06-02 00:53:20] [INFO ] Transformed 2701 transitions.
[2025-06-02 00:53:20] [INFO ] Found NUPN structural information;
[2025-06-02 00:53:20] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 2431 ms. (16 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 00:53:21] [INFO ] Flatten gal took : 362 ms
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
[2025-06-02 00:53:21] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 6/6 properties
[2025-06-02 00:53:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18154720538356494128.gal : 102 ms
[2025-06-02 00:53:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14158798983660366148.prop : 5 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/ReachabilityCardinality18154720538356494128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14158798983660366148.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 6/6 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 ...330
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality14158798983660366148.prop.
// Phase 1: matrix 2701 rows 2328 cols
[2025-06-02 00:53:22] [INFO ] Computed 66 invariants in 49 ms
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, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1886/1976 variables, 52/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1976 variables, 1886/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1976 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 352/2328 variables, 14/2042 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2328 variables, 352/2394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 0/2394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2701/5029 variables, 2328/4722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5029/5029 variables, and 4722 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2914 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2328/2328 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :13 after 14
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :14 after 258
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :258 after 742
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :742 after 1011
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1011 after 1810
At refinement iteration 2 (OVERLAPS) 1886/1976 variables, 52/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1810 after 197821
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :197821 after 242292
At refinement iteration 3 (INCLUDED_ONLY) 0/1976 variables, 1886/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :242292 after 465474
At refinement iteration 4 (INCLUDED_ONLY) 0/1976 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 352/2328 variables, 14/2042 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2328 variables, 352/2394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:27] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 1/2395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:27] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:27] [INFO ] Deduced a trap composed of 110 places in 60 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2328 variables, 2/2397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:28] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2328 variables, 1/2398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:29] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2328 variables, 1/2399 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2328/5029 variables, and 2399 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5023 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/2328 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8079ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2124 edges and 2328 vertex of which 943 / 2328 are part of one of the 30 SCC in 10 ms
Free SCC test removed 913 places
Drop transitions (Empty/Sink Transition effects.) removed 1085 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 292 place count 1415 transition count 1325
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 331 rules applied. Total rules applied 623 place count 1124 transition count 1285
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 7 rules applied. Total rules applied 630 place count 1119 transition count 1283
Reduce places removed 1 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 3 with 58 rules applied. Total rules applied 688 place count 1118 transition count 1226
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 73 rules applied. Total rules applied 761 place count 1061 transition count 1210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 763 place count 1059 transition count 1210
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 763 place count 1059 transition count 1204
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 775 place count 1053 transition count 1204
Discarding 292 places :
Symmetric choice reduction at 6 with 292 rule applications. Total rules 1067 place count 761 transition count 912
Iterating global reduction 6 with 292 rules applied. Total rules applied 1359 place count 761 transition count 912
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1361 place count 761 transition count 910
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 1361 place count 761 transition count 870
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 1441 place count 721 transition count 870
Discarding 37 places :
Symmetric choice reduction at 7 with 37 rule applications. Total rules 1478 place count 684 transition count 819
Iterating global reduction 7 with 37 rules applied. Total rules applied 1515 place count 684 transition count 819
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 7 with 318 rules applied. Total rules applied 1833 place count 525 transition count 660
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1842 place count 525 transition count 651
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1876 place count 508 transition count 785
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1886 place count 508 transition count 775
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1888 place count 507 transition count 788
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 9 with 34 rules applied. Total rules applied 1922 place count 507 transition count 754
Free-agglomeration rule applied 137 times.
Iterating global reduction 9 with 137 rules applied. Total rules applied 2059 place count 507 transition count 617
Reduce places removed 137 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1107 edges and 370 vertex of which 363 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.17 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 159 rules applied. Total rules applied 2218 place count 363 transition count 596
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2225 place count 363 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 11 with 16 rules applied. Total rules applied 2241 place count 363 transition count 573
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 2251 place count 363 transition count 573
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 2253 place count 363 transition count 571
Applied a total of 2253 rules in 890 ms. Remains 363 /2328 variables (removed 1965) and now considering 571/2701 (removed 2130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 363/2328 places, 571/2701 transitions.
RANDOM walk for 40000 steps (8 resets) in 783 ms. (51 steps per ms) remains 3/5 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 588 ms. (67 steps per ms) remains 2/2 properties
[2025-06-02 00:53:31] [INFO ] Flow matrix only has 568 transitions (discarded 3 similar events)
// Phase 1: matrix 568 rows 363 cols
[2025-06-02 00:53:31] [INFO ] Computed 63 invariants in 5 ms
[2025-06-02 00:53:31] [INFO ] State equation strengthened by 135 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) 211/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/363 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 568/931 variables, 363/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 135/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/931 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/931 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 931/931 variables, and 561 constraints, problems are : Problem set: 0 solved, 2 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 363/363 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 2/0 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) 211/274 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:32] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 89/363 variables, 27/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-02 00:53:32] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:53:32] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 568/931 variables, 363/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/931 variables, 135/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/931 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/931 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 931/931 variables, and 564 constraints, problems are : Problem set: 0 solved, 2 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 363/363 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1372ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 261 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=87 )
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 13 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 12635 ms.

BK_STOP 1748825612972

--------------------
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-4B"
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-4B, 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-174876812200215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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