Execution Chart

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

Trace from the execution

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

--------------------
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-ReachabilityFireability-2025-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748818170812

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-2B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-01 22:49:31] [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 22:49:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:49:32] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-01 22:49:32] [INFO ] Transformed 2003 places.
[2025-06-01 22:49:32] [INFO ] Transformed 2292 transitions.
[2025-06-01 22:49:32] [INFO ] Found NUPN structural information;
[2025-06-01 22:49:32] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1602 ms. (24 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 799 ms. (50 steps per ms) remains 6/6 properties
[2025-06-01 22:49:33] [INFO ] Flatten gal took : 311 ms
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
[2025-06-01 22:49:33] [INFO ] Flatten gal took : 136 ms
BEST_FIRST walk for 40002 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
[2025-06-01 22:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4315523517029124188.gal : 69 ms
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
[2025-06-01 22:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3031381969362208066.prop : 12 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/ReachabilityCardinality4315523517029124188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3031381969362208066.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2292 rows 2003 cols
[2025-06-01 22:49:33] [INFO ] Computed 66 invariants in 46 ms
Loading property file /tmp/ReachabilityCardinality3031381969362208066.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/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem NoC3x3-PT-2B-ReachabilityFireability-2025-03 is UNSAT
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem NoC3x3-PT-2B-ReachabilityFireability-2025-11 is UNSAT
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1722/1854 variables, 54/186 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1854 variables, 1722/1908 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1854 variables, 0/1908 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/2003 variables, 12/1920 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 149/2069 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2069 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2292/4295 variables, 2003/4072 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 4072 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2012 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 2 (OVERLAPS) 1246/1287 variables, 29/70 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 3 (INCLUDED_ONLY) 0/1287 variables, 1246/1316 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:36] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 25 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:36] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:36] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:36] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 14 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:36] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 3 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :66 after 509
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:37] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:37] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 9 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :509 after 684
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :684 after 2403
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2403 after 8717
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:37] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:37] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:37] [INFO ] Deduced a trap composed of 112 places in 86 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1287 variables, 10/1326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1287 variables, 0/1326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 716/2003 variables, 37/1363 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 716/2079 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :8717 after 618125
[2025-06-01 22:49:38] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:39] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:39] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:39] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:40] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:40] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 69 ms to minimize.
SMT process timed out in 7288ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1563 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 394 rules applied. Total rules applied 395 place count 1938 transition count 1843
Reduce places removed 385 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 398 rules applied. Total rules applied 793 place count 1553 transition count 1830
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 806 place count 1540 transition count 1830
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 806 place count 1540 transition count 1806
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 854 place count 1516 transition count 1806
Discarding 342 places :
Symmetric choice reduction at 3 with 342 rule applications. Total rules 1196 place count 1174 transition count 1464
Iterating global reduction 3 with 342 rules applied. Total rules applied 1538 place count 1174 transition count 1464
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1538 place count 1174 transition count 1426
Deduced a syphon composed of 38 places in 8 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1614 place count 1136 transition count 1426
Discarding 128 places :
Symmetric choice reduction at 3 with 128 rule applications. Total rules 1742 place count 1008 transition count 1263
Iterating global reduction 3 with 128 rules applied. Total rules applied 1870 place count 1008 transition count 1263
Discarding 119 places :
Symmetric choice reduction at 3 with 119 rule applications. Total rules 1989 place count 889 transition count 1130
Iterating global reduction 3 with 119 rules applied. Total rules applied 2108 place count 889 transition count 1130
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 2149 place count 848 transition count 1059
Iterating global reduction 3 with 41 rules applied. Total rules applied 2190 place count 848 transition count 1059
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 3 with 17 rules applied. Total rules applied 2207 place count 846 transition count 1044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2209 place count 844 transition count 1044
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2236 place count 817 transition count 1017
Iterating global reduction 5 with 27 rules applied. Total rules applied 2263 place count 817 transition count 1017
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 5 with 4 rules applied. Total rules applied 2267 place count 815 transition count 1015
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2269 place count 813 transition count 1015
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2284 place count 798 transition count 985
Iterating global reduction 7 with 15 rules applied. Total rules applied 2299 place count 798 transition count 985
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2314 place count 783 transition count 970
Iterating global reduction 7 with 15 rules applied. Total rules applied 2329 place count 783 transition count 970
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 7 with 19 rules applied. Total rules applied 2348 place count 781 transition count 953
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2350 place count 779 transition count 953
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 289
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 9 with 578 rules applied. Total rules applied 2928 place count 490 transition count 664
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 2940 place count 478 transition count 652
Iterating global reduction 9 with 12 rules applied. Total rules applied 2952 place count 478 transition count 652
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 2960 place count 470 transition count 636
Iterating global reduction 9 with 8 rules applied. Total rules applied 2968 place count 470 transition count 636
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2969 place count 469 transition count 634
Iterating global reduction 9 with 1 rules applied. Total rules applied 2970 place count 469 transition count 634
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 3012 place count 448 transition count 686
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3013 place count 447 transition count 684
Iterating global reduction 9 with 1 rules applied. Total rules applied 3014 place count 447 transition count 684
Free-agglomeration rule applied 26 times.
Iterating global reduction 9 with 26 rules applied. Total rules applied 3040 place count 447 transition count 658
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 3072 place count 421 transition count 652
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3074 place count 421 transition count 650
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3077 place count 421 transition count 647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 3080 place count 418 transition count 647
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3084 place count 418 transition count 647
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3088 place count 418 transition count 647
Applied a total of 3088 rules in 820 ms. Remains 418 /2003 variables (removed 1585) and now considering 647/2292 (removed 1645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 826 ms. Remains : 418/2003 places, 647/2292 transitions.
RANDOM walk for 40000 steps (13 resets) in 373 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (14 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 447697 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 3
Probabilistic random walk after 447697 steps, saw 98018 distinct states, run finished after 3005 ms. (steps per millisecond=148 ) properties seen :0
[2025-06-01 22:49:44] [INFO ] Flow matrix only has 645 transitions (discarded 2 similar events)
// Phase 1: matrix 645 rows 418 cols
[2025-06-01 22:49:44] [INFO ] Computed 54 invariants in 7 ms
[2025-06-01 22:49:44] [INFO ] State equation strengthened by 69 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 193/234 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 136/370 variables, 29/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 635/1005 variables, 370/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 59/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1005 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 58/1063 variables, 48/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 10/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1063 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1063 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 541 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 418/418 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/2 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 193/234 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/370 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:45] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:46] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:46] [INFO ] Deduced a trap composed of 14 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-01 22:49:46] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:46] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 635/1005 variables, 370/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1005 variables, 59/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1005 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/1063 variables, 48/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1063 variables, 10/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1063 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1063 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1063 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 559 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 418/418 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2025-08 FALSE 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 3 properties in 58 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 15087 ms.

BK_STOP 1748818187040

--------------------
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-2B"
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-2B, 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-174876812100183"
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 [ "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 ;