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.r245-tall-171654350200583.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 greatspnxred
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 r245-tall-171654350200583
=====================================================================

--------------------
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 1716682923175

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 00:22:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 00:22:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:22:04] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-26 00:22:04] [INFO ] Transformed 2003 places.
[2024-05-26 00:22:04] [INFO ] Transformed 2292 transitions.
[2024-05-26 00:22:04] [INFO ] Found NUPN structural information;
[2024-05-26 00:22:04] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 283 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 (64 resets) in 1284 ms. (31 steps per ms) remains 6/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-13 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 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 793 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 00:22:05] [INFO ] Computed 66 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 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) 1720/1829 variables, 55/164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1829 variables, 1720/1884 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1829 variables, 0/1884 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 174/2003 variables, 11/1895 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 174/2069 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2069 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2292/4295 variables, 2003/4072 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 4072 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2931 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1672/1758 variables, 53/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1758 variables, 1672/1811 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-26 00:22:09] [INFO ] Deduced a trap composed of 24 places in 556 ms of which 67 ms to minimize.
[2024-05-26 00:22:10] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 9 ms to minimize.
[2024-05-26 00:22:10] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 7 ms to minimize.
[2024-05-26 00:22:11] [INFO ] Deduced a trap composed of 136 places in 378 ms of which 7 ms to minimize.
[2024-05-26 00:22:11] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 6 ms to minimize.
[2024-05-26 00:22:11] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 6 ms to minimize.
[2024-05-26 00:22:12] [INFO ] Deduced a trap composed of 81 places in 277 ms of which 6 ms to minimize.
[2024-05-26 00:22:12] [INFO ] Deduced a trap composed of 173 places in 273 ms of which 6 ms to minimize.
[2024-05-26 00:22:12] [INFO ] Deduced a trap composed of 81 places in 255 ms of which 5 ms to minimize.
[2024-05-26 00:22:13] [INFO ] Deduced a trap composed of 106 places in 300 ms of which 6 ms to minimize.
[2024-05-26 00:22:13] [INFO ] Deduced a trap composed of 73 places in 279 ms of which 6 ms to minimize.
[2024-05-26 00:22:13] [INFO ] Deduced a trap composed of 61 places in 305 ms of which 5 ms to minimize.
[2024-05-26 00:22:14] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 5 ms to minimize.
SMT process timed out in 8324ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1484 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 8 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 366 rules applied. Total rules applied 367 place count 1939 transition count 1870
Reduce places removed 358 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 392 rules applied. Total rules applied 759 place count 1581 transition count 1836
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 793 place count 1547 transition count 1836
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 793 place count 1547 transition count 1815
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 835 place count 1526 transition count 1815
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1165 place count 1196 transition count 1485
Iterating global reduction 3 with 330 rules applied. Total rules applied 1495 place count 1196 transition count 1485
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1495 place count 1196 transition count 1453
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1559 place count 1164 transition count 1453
Discarding 119 places :
Symmetric choice reduction at 3 with 119 rule applications. Total rules 1678 place count 1045 transition count 1312
Iterating global reduction 3 with 119 rules applied. Total rules applied 1797 place count 1045 transition count 1312
Discarding 110 places :
Symmetric choice reduction at 3 with 110 rule applications. Total rules 1907 place count 935 transition count 1190
Iterating global reduction 3 with 110 rules applied. Total rules applied 2017 place count 935 transition count 1190
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 2054 place count 898 transition count 1122
Iterating global reduction 3 with 37 rules applied. Total rules applied 2091 place count 898 transition count 1122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 13 rules applied. Total rules applied 2104 place count 896 transition count 1111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2106 place count 894 transition count 1111
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2133 place count 867 transition count 1084
Iterating global reduction 5 with 27 rules applied. Total rules applied 2160 place count 867 transition count 1084
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 2164 place count 865 transition count 1082
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2166 place count 863 transition count 1082
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2180 place count 849 transition count 1054
Iterating global reduction 7 with 14 rules applied. Total rules applied 2194 place count 849 transition count 1054
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2207 place count 836 transition count 1041
Iterating global reduction 7 with 13 rules applied. Total rules applied 2220 place count 836 transition count 1041
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 7 with 17 rules applied. Total rules applied 2237 place count 834 transition count 1026
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2239 place count 832 transition count 1026
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 1 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 9 with 542 rules applied. Total rules applied 2781 place count 561 transition count 755
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 2792 place count 550 transition count 743
Iterating global reduction 9 with 11 rules applied. Total rules applied 2803 place count 550 transition count 743
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2808 place count 545 transition count 733
Iterating global reduction 9 with 5 rules applied. Total rules applied 2813 place count 545 transition count 733
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2815 place count 543 transition count 727
Iterating global reduction 9 with 2 rules applied. Total rules applied 2817 place count 543 transition count 727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2819 place count 542 transition count 726
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 2865 place count 519 transition count 802
Free-agglomeration rule applied 31 times.
Iterating global reduction 9 with 31 rules applied. Total rules applied 2896 place count 519 transition count 771
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 2931 place count 488 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 2942 place count 488 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2943 place count 487 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2944 place count 487 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2945 place count 486 transition count 755
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2946 place count 486 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2947 place count 485 transition count 754
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 13 with 12 rules applied. Total rules applied 2959 place count 485 transition count 754
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2961 place count 485 transition count 754
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2962 place count 484 transition count 753
Applied a total of 2962 rules in 871 ms. Remains 484 /2003 variables (removed 1519) and now considering 753/2292 (removed 1539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 484/2003 places, 753/2292 transitions.
RANDOM walk for 40000 steps (392 resets) in 1212 ms. (32 steps per ms) remains 3/4 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (21 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 113 ms. (350 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
[2024-05-26 00:22:15] [INFO ] Flow matrix only has 744 transitions (discarded 9 similar events)
// Phase 1: matrix 744 rows 484 cols
[2024-05-26 00:22:15] [INFO ] Computed 53 invariants in 7 ms
[2024-05-26 00:22:15] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 223/269 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 153/422 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 725/1147 variables, 422/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1147 variables, 56/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1147 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 77/1224 variables, 58/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1224 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/1227 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 3/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1227 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1228 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1228 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1228 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1228/1228 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 484/484 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 223/269 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/422 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:22:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 725/1147 variables, 422/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1147 variables, 56/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1147 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/1224 variables, 58/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1224 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1224 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 00:22:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:22:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-26 00:22:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1224 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1224 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1227 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1227 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1227 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1228 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1228 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1228 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1228/1228 variables, and 616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 484/484 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 2420ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 147 ms.
Support contains 34 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 753/753 transitions.
Graph (trivial) has 72 edges and 484 vertex of which 2 / 484 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 482 transition count 743
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 474 transition count 741
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 472 transition count 741
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 472 transition count 736
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 467 transition count 736
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 43 place count 456 transition count 721
Iterating global reduction 3 with 11 rules applied. Total rules applied 54 place count 456 transition count 721
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 456 transition count 719
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 456 transition count 717
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 60 place count 454 transition count 717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 452 transition count 708
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 452 transition count 708
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 108 place count 430 transition count 686
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 117 place count 421 transition count 674
Iterating global reduction 4 with 9 rules applied. Total rules applied 126 place count 421 transition count 674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 421 transition count 671
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 131 place count 419 transition count 667
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 419 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 134 place count 419 transition count 666
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 415 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 415 transition count 684
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 151 place count 415 transition count 676
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 162 place count 407 transition count 673
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 407 transition count 673
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 165 place count 406 transition count 672
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 168 place count 406 transition count 672
Applied a total of 168 rules in 120 ms. Remains 406 /484 variables (removed 78) and now considering 672/753 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 406/484 places, 672/753 transitions.
RANDOM walk for 40000 steps (490 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (29 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 592213 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 592213 steps, saw 132805 distinct states, run finished after 3005 ms. (steps per millisecond=197 ) properties seen :0
[2024-05-26 00:22:21] [INFO ] Flow matrix only has 662 transitions (discarded 10 similar events)
// Phase 1: matrix 662 rows 406 cols
[2024-05-26 00:22:21] [INFO ] Computed 52 invariants in 11 ms
[2024-05-26 00:22:21] [INFO ] State equation strengthened by 68 read => feed constraints.
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) 172/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/347 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 643/990 variables, 347/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/990 variables, 59/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/990 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 71/1061 variables, 52/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1061 variables, 9/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1061 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/1068 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1068 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1068 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1068 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1068/1068 variables, and 526 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 406/406 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) 172/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 141/347 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-26 00:22:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-26 00:22:22] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-26 00:22:22] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-26 00:22:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 643/990 variables, 347/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/990 variables, 59/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 71/1061 variables, 52/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1061 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1061 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1061 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/1068 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1068 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1068 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1068 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1068/1068 variables, and 538 constraints, problems are : Problem set: 0 solved, 1 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 406/406 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 34 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 406/406 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-05-26 00:22:22] [INFO ] Flow matrix only has 662 transitions (discarded 10 similar events)
[2024-05-26 00:22:22] [INFO ] Invariant cache hit.
[2024-05-26 00:22:32] [INFO ] Implicit Places using invariants in 9411 ms returned [11, 44, 83, 115, 271, 309, 341]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 9431 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 399/406 places, 672/672 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 385 transition count 658
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 385 transition count 644
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 385 transition count 643
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 385 transition count 643
Applied a total of 44 rules in 52 ms. Remains 385 /399 variables (removed 14) and now considering 643/672 (removed 29) transitions.
[2024-05-26 00:22:32] [INFO ] Flow matrix only has 634 transitions (discarded 9 similar events)
// Phase 1: matrix 634 rows 385 cols
[2024-05-26 00:22:32] [INFO ] Computed 45 invariants in 5 ms
[2024-05-26 00:22:32] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-26 00:22:32] [INFO ] Flow matrix only has 634 transitions (discarded 9 similar events)
[2024-05-26 00:22:32] [INFO ] Invariant cache hit.
[2024-05-26 00:22:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 00:22:32] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [6, 10, 31, 32, 35, 36, 40, 41, 73, 76, 77, 95, 96, 103, 104, 107, 138, 139, 140, 141, 145, 146, 150, 151, 152, 158, 162, 248, 249, 252, 253, 254, 257, 258, 259, 290, 294, 311, 312, 313, 317, 318, 322, 323, 364, 365, 368, 369]
Discarding 48 places :
Implicit Place search using SMT with State Equation took 834 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 337/406 places, 643/672 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 337 transition count 638
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 332 transition count 638
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 74 place count 300 transition count 606
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 96 place count 289 transition count 628
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 2 with 46 rules applied. Total rules applied 142 place count 289 transition count 595
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 196 place count 242 transition count 588
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 241 transition count 585
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 241 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 241 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 241 transition count 583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 209 place count 241 transition count 583
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 241 transition count 583
Applied a total of 210 rules in 53 ms. Remains 241 /337 variables (removed 96) and now considering 583/643 (removed 60) transitions.
[2024-05-26 00:22:33] [INFO ] Flow matrix only has 569 transitions (discarded 14 similar events)
// Phase 1: matrix 569 rows 241 cols
[2024-05-26 00:22:33] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 00:22:33] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-26 00:22:33] [INFO ] Flow matrix only has 569 transitions (discarded 14 similar events)
[2024-05-26 00:22:33] [INFO ] Invariant cache hit.
[2024-05-26 00:22:33] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-26 00:22:33] [INFO ] Implicit Places using invariants and state equation in 389 ms returned [43]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 507 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 240/406 places, 581/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 581/581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 10916 ms. Remains : 240/406 places, 581/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1058288 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1058288 steps, saw 145472 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
[2024-05-26 00:22:36] [INFO ] Flow matrix only has 567 transitions (discarded 14 similar events)
// Phase 1: matrix 567 rows 240 cols
[2024-05-26 00:22:36] [INFO ] Computed 32 invariants in 4 ms
[2024-05-26 00:22:36] [INFO ] State equation strengthened by 104 read => feed constraints.
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) 90/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 491/665 variables, 174/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 15/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 142/807 variables, 66/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 89/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/807 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/807 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 240/240 constraints, ReadFeed: 104/104 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) 90/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 491/665 variables, 174/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 15/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 142/807 variables, 66/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 89/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/807 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/807 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/807 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/807 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 240/240 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 32916 ms.
ITS solved all properties within timeout

BK_STOP 1716682957302

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r245-tall-171654350200583"
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 ;