Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351900583.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool 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 r246-tall-171654351900583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716694439932

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 202405141337
[2024-05-26 03:34:01] [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]
[2024-05-26 03:34:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:34:01] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-26 03:34:01] [INFO ] Transformed 2003 places.
[2024-05-26 03:34:01] [INFO ] Transformed 2292 transitions.
[2024-05-26 03:34:01] [INFO ] Found NUPN structural information;
[2024-05-26 03:34:01] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (63 resets) in 1472 ms. (27 steps per ms) remains 7/16 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 500 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1029 ms. (38 steps per ms) remains 7/7 properties
[2024-05-26 03:34:02] [INFO ] Flatten gal took : 439 ms
BEST_FIRST walk for 40003 steps (8 resets) in 482 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
[2024-05-26 03:34:02] [INFO ] Flatten gal took : 206 ms
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/7 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-26 03:34:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13100652146509057876.gal : 61 ms
[2024-05-26 03:34:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10631315812571149945.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13100652146509057876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10631315812571149945.prop' '--nowitness' '--gen-order' 'FOLLOW'

// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 03:34:03] [INFO ] Computed 66 invariants in 54 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10631315812571149945.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem NoC3x3-PT-2B-ReachabilityFireability-2024-10 is UNSAT
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1706/1849 variables, 57/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1849 variables, 1706/1906 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1849 variables, 0/1906 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 154/2003 variables, 9/1915 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 154/2069 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2069 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2292/4295 variables, 2003/4072 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 4072 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2612 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1715/1836 variables, 56/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1836 variables, 1715/1892 constraints. Problems are: Problem set: 1 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 10
[2024-05-26 03:34:07] [INFO ] Deduced a trap composed of 35 places in 631 ms of which 73 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
[2024-05-26 03:34:07] [INFO ] Deduced a trap composed of 64 places in 434 ms of which 8 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
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
[2024-05-26 03:34:08] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 6 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
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :8717 after 618125
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :618125 after 2.28073e+08
[2024-05-26 03:34:08] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 7 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.28073e+08 after 2.89543e+09
[2024-05-26 03:34:08] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 6 ms to minimize.
[2024-05-26 03:34:09] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 7 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.89543e+09 after 1.29063e+10
[2024-05-26 03:34:09] [INFO ] Deduced a trap composed of 75 places in 310 ms of which 5 ms to minimize.
[2024-05-26 03:34:09] [INFO ] Deduced a trap composed of 59 places in 346 ms of which 6 ms to minimize.
[2024-05-26 03:34:10] [INFO ] Deduced a trap composed of 66 places in 345 ms of which 6 ms to minimize.
[2024-05-26 03:34:10] [INFO ] Deduced a trap composed of 68 places in 344 ms of which 7 ms to minimize.
[2024-05-26 03:34:11] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.29063e+10 after 1.05873e+11
[2024-05-26 03:34:11] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 6 ms to minimize.
SMT process timed out in 8186ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1405 edges and 2003 vertex of which 40 / 2003 are part of one of the 5 SCC in 7 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 349 rules applied. Total rules applied 350 place count 1960 transition count 1911
Reduce places removed 341 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 1 with 388 rules applied. Total rules applied 738 place count 1619 transition count 1864
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 785 place count 1572 transition count 1864
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 785 place count 1572 transition count 1839
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 835 place count 1547 transition count 1839
Discarding 322 places :
Symmetric choice reduction at 3 with 322 rule applications. Total rules 1157 place count 1225 transition count 1517
Iterating global reduction 3 with 322 rules applied. Total rules applied 1479 place count 1225 transition count 1517
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1479 place count 1225 transition count 1490
Deduced a syphon composed of 27 places in 9 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1533 place count 1198 transition count 1490
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 1647 place count 1084 transition count 1357
Iterating global reduction 3 with 114 rules applied. Total rules applied 1761 place count 1084 transition count 1357
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 1863 place count 982 transition count 1244
Iterating global reduction 3 with 102 rules applied. Total rules applied 1965 place count 982 transition count 1244
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1996 place count 951 transition count 1189
Iterating global reduction 3 with 31 rules applied. Total rules applied 2027 place count 951 transition count 1189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 11 rules applied. Total rules applied 2038 place count 949 transition count 1180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2040 place count 947 transition count 1180
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2063 place count 924 transition count 1157
Iterating global reduction 5 with 23 rules applied. Total rules applied 2086 place count 924 transition count 1157
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 2090 place count 922 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2092 place count 920 transition count 1155
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2103 place count 909 transition count 1133
Iterating global reduction 7 with 11 rules applied. Total rules applied 2114 place count 909 transition count 1133
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 2124 place count 899 transition count 1123
Iterating global reduction 7 with 10 rules applied. Total rules applied 2134 place count 899 transition count 1123
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 14 rules applied. Total rules applied 2148 place count 897 transition count 1111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2150 place count 895 transition count 1111
Performed 273 Post agglomeration using F-continuation condition.Transition count delta: 273
Deduced a syphon composed of 273 places in 1 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 9 with 546 rules applied. Total rules applied 2696 place count 622 transition count 838
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 2707 place count 611 transition count 826
Iterating global reduction 9 with 11 rules applied. Total rules applied 2718 place count 611 transition count 826
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2723 place count 606 transition count 816
Iterating global reduction 9 with 5 rules applied. Total rules applied 2728 place count 606 transition count 816
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2730 place count 604 transition count 810
Iterating global reduction 9 with 2 rules applied. Total rules applied 2732 place count 604 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2734 place count 603 transition count 809
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2774 place count 583 transition count 854
Free-agglomeration rule applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 2804 place count 583 transition count 824
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 2837 place count 553 transition count 821
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 2845 place count 553 transition count 813
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2846 place count 553 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2847 place count 552 transition count 812
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2849 place count 552 transition count 810
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2851 place count 550 transition count 810
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 2864 place count 550 transition count 810
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2865 place count 550 transition count 810
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2866 place count 549 transition count 809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2867 place count 548 transition count 809
Applied a total of 2867 rules in 918 ms. Remains 548 /2003 variables (removed 1455) and now considering 809/2292 (removed 1483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 548/2003 places, 809/2292 transitions.
RANDOM walk for 40000 steps (271 resets) in 698 ms. (57 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (19 resets) in 93 ms. (425 steps per ms) remains 3/4 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
[2024-05-26 03:34:12] [INFO ] Flow matrix only has 796 transitions (discarded 13 similar events)
// Phase 1: matrix 796 rows 548 cols
[2024-05-26 03:34:12] [INFO ] Computed 53 invariants in 6 ms
[2024-05-26 03:34:12] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 328/410 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/485 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 781/1266 variables, 485/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1266 variables, 59/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1266 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 74/1340 variables, 59/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1340 variables, 4/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1340 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/1343 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1343 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1343 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/1344 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1344 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1344 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1344/1344 variables, and 664 constraints, problems are : Problem set: 0 solved, 3 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 548/548 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 328/410 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.05873e+11 after 1.37834e+14
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-26 03:34:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 75/485 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-26 03:34:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 781/1266 variables, 485/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1266 variables, 59/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 74/1340 variables, 59/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1340 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1340 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/1343 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1343 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 03:34:15] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1343 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/1344 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1344 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1344 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1344/1344 variables, and 686 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2909 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 548/548 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3621ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 709 ms.
Support contains 34 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 809/809 transitions.
Graph (trivial) has 145 edges and 548 vertex of which 8 / 548 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 543 transition count 786
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 528 transition count 784
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 526 transition count 784
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 36 place count 526 transition count 774
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 56 place count 516 transition count 774
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 76 place count 496 transition count 735
Iterating global reduction 3 with 20 rules applied. Total rules applied 96 place count 496 transition count 735
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 496 transition count 732
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 496 transition count 730
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 494 transition count 730
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 492 transition count 721
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 492 transition count 721
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 181 place count 455 transition count 684
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 199 place count 437 transition count 663
Iterating global reduction 4 with 18 rules applied. Total rules applied 217 place count 437 transition count 663
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 437 transition count 660
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 225 place count 432 transition count 650
Iterating global reduction 5 with 5 rules applied. Total rules applied 230 place count 432 transition count 650
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 432 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 234 place count 431 transition count 645
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 431 transition count 645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 431 transition count 644
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 248 place count 425 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 249 place count 425 transition count 676
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 250 place count 425 transition count 675
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 266 place count 425 transition count 659
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 288 place count 409 transition count 653
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 289 place count 409 transition count 652
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 290 place count 409 transition count 652
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 292 place count 408 transition count 651
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 298 place count 408 transition count 651
Applied a total of 298 rules in 151 ms. Remains 408 /548 variables (removed 140) and now considering 651/809 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 408/548 places, 651/809 transitions.
RANDOM walk for 40000 steps (483 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (26 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 131072
Interrupted probabilistic random walk after 618781 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 618781 steps, saw 112991 distinct states, run finished after 3005 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-26 03:34:20] [INFO ] Flow matrix only has 641 transitions (discarded 10 similar events)
// Phase 1: matrix 641 rows 408 cols
[2024-05-26 03:34:20] [INFO ] Computed 52 invariants in 8 ms
[2024-05-26 03:34:20] [INFO ] State equation strengthened by 68 read => feed constraints.
SDD size :1.37834e+14 after 2.30394e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/209 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/349 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/971 variables, 349/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 59/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 71/1042 variables, 52/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1042 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/1049 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1049 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1049 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1049 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1049/1049 variables, and 528 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 408/408 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/209 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 03:34:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-26 03:34:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-26 03:34:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-26 03:34:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
[2024-05-26 03:34:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 140/349 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 622/971 variables, 349/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 59/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 03:34:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 71/1042 variables, 52/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1042 variables, 9/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1042 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1049 variables, 7/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1049 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1049 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1049 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1049/1049 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 408/408 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1323ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 137 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 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 20642 ms.

BK_STOP 1716694461781

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5568"
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 r246-tall-171654351900583"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;