About the Execution of GreatSPN+red for NoC3x3-PT-7B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
778.348 | 15326.00 | 37084.00 | 95.20 | TFFTTFTTTFFFFTTF | normal |
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-171654350400663.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-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350400663
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 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 2.0M 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-7B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716698969234
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-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 04:49:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 04:49:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:49:30] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2024-05-26 04:49:30] [INFO ] Transformed 7014 places.
[2024-05-26 04:49:30] [INFO ] Transformed 8833 transitions.
[2024-05-26 04:49:30] [INFO ] Found NUPN structural information;
[2024-05-26 04:49:31] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (13 resets) in 1961 ms. (20 steps per ms) remains 11/16 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
// Phase 1: matrix 8833 rows 7014 cols
[2024-05-26 04:49:32] [INFO ] Computed 66 invariants in 81 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 6675/6937 variables, 56/318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6937 variables, 6675/6993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6937 variables, 0/6993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 77/7014 variables, 10/7003 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7014 variables, 77/7080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7014 variables, 0/7080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5364ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 262 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7140 edges and 7014 vertex of which 1841 / 7014 are part of one of the 18 SCC in 21 ms
Free SCC test removed 1823 places
Drop transitions (Empty/Sink Transition effects.) removed 2185 transitions
Reduce isomorphic transitions removed 2185 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1937 transitions
Trivial Post-agglo rules discarded 1937 transitions
Performed 1937 trivial Post agglomeration. Transition count delta: 1937
Iterating post reduction 0 with 1937 rules applied. Total rules applied 1938 place count 5191 transition count 4711
Reduce places removed 1937 places and 0 transitions.
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 1 with 2164 rules applied. Total rules applied 4102 place count 3254 transition count 4484
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2 with 112 rules applied. Total rules applied 4214 place count 3146 transition count 4480
Reduce places removed 2 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 3 with 155 rules applied. Total rules applied 4369 place count 3144 transition count 4327
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 4 with 178 rules applied. Total rules applied 4547 place count 2991 transition count 4302
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 4554 place count 2984 transition count 4302
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 4554 place count 2984 transition count 4261
Deduced a syphon composed of 41 places in 10 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 4636 place count 2943 transition count 4261
Discarding 633 places :
Symmetric choice reduction at 6 with 633 rule applications. Total rules 5269 place count 2310 transition count 3611
Iterating global reduction 6 with 633 rules applied. Total rules applied 5902 place count 2310 transition count 3611
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
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 6 with 30 rules applied. Total rules applied 5932 place count 2310 transition count 3581
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 10 rules applied. Total rules applied 5942 place count 2302 transition count 3579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5943 place count 2301 transition count 3579
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 38 Pre rules applied. Total rules applied 5943 place count 2301 transition count 3541
Deduced a syphon composed of 38 places in 20 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 9 with 76 rules applied. Total rules applied 6019 place count 2263 transition count 3541
Discarding 282 places :
Symmetric choice reduction at 9 with 282 rule applications. Total rules 6301 place count 1981 transition count 3131
Iterating global reduction 9 with 282 rules applied. Total rules applied 6583 place count 1981 transition count 3131
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 9 with 95 rules applied. Total rules applied 6678 place count 1981 transition count 3036
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 6699 place count 1960 transition count 2994
Iterating global reduction 10 with 21 rules applied. Total rules applied 6720 place count 1960 transition count 2994
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 6737 place count 1943 transition count 2977
Iterating global reduction 10 with 17 rules applied. Total rules applied 6754 place count 1943 transition count 2977
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 6768 place count 1929 transition count 2960
Iterating global reduction 10 with 14 rules applied. Total rules applied 6782 place count 1929 transition count 2960
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 6793 place count 1918 transition count 2938
Iterating global reduction 10 with 11 rules applied. Total rules applied 6804 place count 1918 transition count 2938
Performed 602 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 602 places in 2 ms
Reduce places removed 602 places and 0 transitions.
Iterating global reduction 10 with 1204 rules applied. Total rules applied 8008 place count 1316 transition count 2286
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 10 with 64 rules applied. Total rules applied 8072 place count 1316 transition count 2222
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 8076 place count 1312 transition count 2213
Iterating global reduction 11 with 4 rules applied. Total rules applied 8080 place count 1312 transition count 2213
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 8083 place count 1309 transition count 2209
Iterating global reduction 11 with 3 rules applied. Total rules applied 8086 place count 1309 transition count 2209
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 11 with 58 rules applied. Total rules applied 8144 place count 1280 transition count 2180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 8150 place count 1280 transition count 2174
Performed 101 Post agglomeration using F-continuation condition with reduction of 157 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 8352 place count 1179 transition count 2452
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 12 with 103 rules applied. Total rules applied 8455 place count 1179 transition count 2349
Performed 101 Post agglomeration using F-continuation condition with reduction of 145 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 13 with 202 rules applied. Total rules applied 8657 place count 1078 transition count 2583
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 13 with 105 rules applied. Total rules applied 8762 place count 1078 transition count 2478
Performed 79 Post agglomeration using F-continuation condition with reduction of 124 identical transitions.
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 14 with 158 rules applied. Total rules applied 8920 place count 999 transition count 2720
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 14 with 105 rules applied. Total rules applied 9025 place count 999 transition count 2615
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 9037 place count 993 transition count 2696
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 9046 place count 993 transition count 2687
Drop transitions (Redundant composition of simpler transitions.) removed 446 transitions
Redundant transition composition rules discarded 446 transitions
Iterating global reduction 16 with 446 rules applied. Total rules applied 9492 place count 993 transition count 2241
Discarding 15 places :
Symmetric choice reduction at 16 with 15 rule applications. Total rules 9507 place count 978 transition count 2225
Iterating global reduction 16 with 15 rules applied. Total rules applied 9522 place count 978 transition count 2225
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -118
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 16 with 18 rules applied. Total rules applied 9540 place count 969 transition count 2343
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 16 with 39 rules applied. Total rules applied 9579 place count 969 transition count 2304
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 9580 place count 968 transition count 2303
Iterating global reduction 16 with 1 rules applied. Total rules applied 9581 place count 968 transition count 2303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9583 place count 967 transition count 2322
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 9596 place count 967 transition count 2309
Free-agglomeration rule applied 142 times.
Iterating global reduction 16 with 142 rules applied. Total rules applied 9738 place count 967 transition count 2167
Reduce places removed 142 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 3208 edges and 825 vertex of which 824 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 159 rules applied. Total rules applied 9897 place count 824 transition count 2151
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 17 with 48 rules applied. Total rules applied 9945 place count 824 transition count 2103
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 9949 place count 824 transition count 2099
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 9953 place count 820 transition count 2099
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 9955 place count 820 transition count 2097
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 9957 place count 820 transition count 2095
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 9959 place count 818 transition count 2095
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 9960 place count 818 transition count 2094
Partial Free-agglomeration rule applied 72 times.
Drop transitions (Partial Free agglomeration) removed 72 transitions
Iterating global reduction 19 with 72 rules applied. Total rules applied 10032 place count 818 transition count 2094
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 10053 place count 818 transition count 2073
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 10055 place count 818 transition count 2073
Applied a total of 10055 rules in 2458 ms. Remains 818 /7014 variables (removed 6196) and now considering 2073/8833 (removed 6760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2470 ms. Remains : 818/7014 places, 2073/8833 transitions.
RANDOM walk for 40000 steps (8 resets) in 674 ms. (59 steps per ms) remains 7/11 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 6/7 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
[2024-05-26 04:49:41] [INFO ] Flow matrix only has 2053 transitions (discarded 20 similar events)
// Phase 1: matrix 2053 rows 818 cols
[2024-05-26 04:49:41] [INFO ] Computed 65 invariants in 7 ms
[2024-05-26 04:49:41] [INFO ] State equation strengthened by 165 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 342/371 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 447/818 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/818 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2053/2871 variables, 818/883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2871 variables, 165/1048 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2871 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2871 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2871/2871 variables, and 1048 constraints, problems are : Problem set: 0 solved, 4 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 818/818 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 342/371 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 447/818 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 04:49:42] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/818 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 04:49:42] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2053/2871 variables, 818/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2871 variables, 165/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2871 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 04:49:43] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2871 variables, 1/1055 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2871 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2871 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2871/2871 variables, and 1055 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2395 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 818/818 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3316ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 11694 steps, including 64 resets, run visited all 1 properties in 50 ms. (steps per millisecond=233 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 144 ms.
All properties solved without resorting to model-checking.
Total runtime 14062 ms.
ITS solved all properties within timeout
BK_STOP 1716698984560
--------------------
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-7B"
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-7B, 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-171654350400663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B 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 '
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 ;