About the Execution of GreatSPN+red for NoC3x3-PT-6B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12135.231 | 3600000.00 | 5808779.00 | 7637.70 | TTF?TTFTTTTFFTFF | 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-171654350300647.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-6B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300647
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 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 552K 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-6B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2023-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716695251157
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-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:47:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 03:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:47:32] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-26 03:47:32] [INFO ] Transformed 1544 places.
[2024-05-26 03:47:32] [INFO ] Transformed 2229 transitions.
[2024-05-26 03:47:32] [INFO ] Found NUPN structural information;
[2024-05-26 03:47:32] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (91 resets) in 1402 ms. (28 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 444 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 1033 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 213 ms. (186 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
// Phase 1: matrix 2229 rows 1544 cols
[2024-05-26 03:47:33] [INFO ] Computed 66 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem NoC3x3-PT-6B-ReachabilityFireability-2024-14 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1366/1531 variables, 64/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1531 variables, 1366/1595 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1531 variables, 0/1595 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/1544 variables, 2/1597 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 13/1610 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1923 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 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/161 variables, 161/161 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem NoC3x3-PT-6B-ReachabilityFireability-2023-04 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2023-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1370/1531 variables, 64/225 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1531 variables, 1370/1595 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-26 03:47:36] [INFO ] Deduced a trap composed of 101 places in 244 ms of which 44 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1531 variables, 1/1596 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-26 03:47:37] [INFO ] Deduced a trap composed of 98 places in 276 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1531 variables, 1/1597 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1531 variables, 0/1597 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/1544 variables, 2/1599 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 13/1612 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/1612 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2229/3773 variables, 1544/3156 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3159 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5010 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 7240ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1544 transition count 2036
Reduce places removed 193 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 207 rules applied. Total rules applied 400 place count 1351 transition count 2022
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 414 place count 1337 transition count 2022
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 414 place count 1337 transition count 1967
Deduced a syphon composed of 55 places in 6 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 524 place count 1282 transition count 1967
Discarding 263 places :
Symmetric choice reduction at 3 with 263 rule applications. Total rules 787 place count 1019 transition count 1704
Iterating global reduction 3 with 263 rules applied. Total rules applied 1050 place count 1019 transition count 1704
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1050 place count 1019 transition count 1676
Deduced a syphon composed of 28 places in 7 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1106 place count 991 transition count 1676
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 1195 place count 902 transition count 1434
Iterating global reduction 3 with 89 rules applied. Total rules applied 1284 place count 902 transition count 1434
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1321 place count 865 transition count 1352
Iterating global reduction 3 with 37 rules applied. Total rules applied 1358 place count 865 transition count 1352
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1368 place count 855 transition count 1332
Iterating global reduction 3 with 10 rules applied. Total rules applied 1378 place count 855 transition count 1332
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1384 place count 849 transition count 1314
Iterating global reduction 3 with 6 rules applied. Total rules applied 1390 place count 849 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1391 place count 848 transition count 1312
Iterating global reduction 3 with 1 rules applied. Total rules applied 1392 place count 848 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1393 place count 847 transition count 1310
Iterating global reduction 3 with 1 rules applied. Total rules applied 1394 place count 847 transition count 1310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1398 place count 847 transition count 1306
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 2 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 1628 place count 732 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1629 place count 731 transition count 1185
Iterating global reduction 4 with 1 rules applied. Total rules applied 1630 place count 731 transition count 1185
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1832 place count 630 transition count 1230
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1872 place count 610 transition count 1261
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 1893 place count 610 transition count 1240
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 1918 place count 610 transition count 1215
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1947 place count 585 transition count 1211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1949 place count 585 transition count 1209
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1952 place count 585 transition count 1209
Applied a total of 1952 rules in 757 ms. Remains 585 /1544 variables (removed 959) and now considering 1209/2229 (removed 1020) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 585/1544 places, 1209/2229 transitions.
RANDOM walk for 40000 steps (179 resets) in 746 ms. (53 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
[2024-05-26 03:47:42] [INFO ] Flow matrix only has 1197 transitions (discarded 12 similar events)
// Phase 1: matrix 1197 rows 585 cols
[2024-05-26 03:47:42] [INFO ] Computed 66 invariants in 19 ms
[2024-05-26 03:47:42] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 465/569 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/585 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1197/1782 variables, 585/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1782 variables, 49/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1782 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 585/585 constraints, ReadFeed: 49/49 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/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 465/569 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/585 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1197/1782 variables, 585/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1782 variables, 49/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1782 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9322 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 585/585 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 10250ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1789 ms.
Support contains 104 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1209/1209 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 585 transition count 1208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 584 transition count 1208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 584 transition count 1205
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 581 transition count 1205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 578 transition count 1196
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 578 transition count 1196
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 570 transition count 1188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 569 transition count 1179
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 569 transition count 1179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 567 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 566 transition count 1176
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 566 transition count 1176
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 566 transition count 1175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 565 transition count 1175
Applied a total of 40 rules in 86 ms. Remains 565 /585 variables (removed 20) and now considering 1175/1209 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 565/585 places, 1175/1209 transitions.
RANDOM walk for 40000 steps (189 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208967 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208967 steps, saw 151879 distinct states, run finished after 3006 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-26 03:47:57] [INFO ] Flow matrix only has 1165 transitions (discarded 10 similar events)
// Phase 1: matrix 1165 rows 565 cols
[2024-05-26 03:47:57] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 03:47:57] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 445/549 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/565 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1165/1730 variables, 565/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1730 variables, 49/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1730 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1730 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1730/1730 variables, and 680 constraints, problems are : Problem set: 0 solved, 2 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 565/565 constraints, ReadFeed: 49/49 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/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 445/549 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:47:58] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/565 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1165/1730 variables, 565/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1730 variables, 49/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1730 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1730/1730 variables, and 683 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31436 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 565/565 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 32063ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 104 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 1175/1175 transitions.
Applied a total of 0 rules in 17 ms. Remains 565 /565 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 565/565 places, 1175/1175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 1175/1175 transitions.
Applied a total of 0 rules in 15 ms. Remains 565 /565 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
[2024-05-26 03:48:29] [INFO ] Flow matrix only has 1165 transitions (discarded 10 similar events)
[2024-05-26 03:48:29] [INFO ] Invariant cache hit.
[2024-05-26 03:48:30] [INFO ] Implicit Places using invariants in 443 ms returned [35, 74, 371, 542]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 453 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 561/565 places, 1175/1175 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 551 transition count 1165
Applied a total of 20 rules in 31 ms. Remains 551 /561 variables (removed 10) and now considering 1165/1175 (removed 10) transitions.
[2024-05-26 03:48:30] [INFO ] Flow matrix only has 1155 transitions (discarded 10 similar events)
// Phase 1: matrix 1155 rows 551 cols
[2024-05-26 03:48:30] [INFO ] Computed 62 invariants in 6 ms
[2024-05-26 03:48:30] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-26 03:48:30] [INFO ] Flow matrix only has 1155 transitions (discarded 10 similar events)
[2024-05-26 03:48:30] [INFO ] Invariant cache hit.
[2024-05-26 03:48:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 03:48:31] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 551/565 places, 1165/1175 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1590 ms. Remains : 551/565 places, 1165/1175 transitions.
RANDOM walk for 40000 steps (195 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 81 ms. (487 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-26 03:48:31] [INFO ] Flow matrix only has 1155 transitions (discarded 10 similar events)
[2024-05-26 03:48:31] [INFO ] Invariant cache hit.
[2024-05-26 03:48:31] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/536 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/551 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1155/1706 variables, 551/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1706 variables, 54/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1706 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1706 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 667 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 551/551 constraints, ReadFeed: 54/54 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/536 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/551 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1155/1706 variables, 551/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1706 variables, 54/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1706 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1706 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1706 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1706/1706 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2549 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 551/551 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3073ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 87 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1165/1165 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 551 transition count 1164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 550 transition count 1164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 550 transition count 1162
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 548 transition count 1162
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 543 transition count 1150
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 543 transition count 1150
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 538 transition count 1145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 535 transition count 1145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 533 transition count 1137
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 533 transition count 1137
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 533 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 532 transition count 1136
Applied a total of 38 rules in 58 ms. Remains 532 /551 variables (removed 19) and now considering 1136/1165 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 532/551 places, 1136/1165 transitions.
RANDOM walk for 40000 steps (200 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301477 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301477 steps, saw 171071 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-26 03:48:38] [INFO ] Flow matrix only has 1126 transitions (discarded 10 similar events)
// Phase 1: matrix 1126 rows 532 cols
[2024-05-26 03:48:38] [INFO ] Computed 62 invariants in 12 ms
[2024-05-26 03:48:38] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/517 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/532 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1126/1658 variables, 532/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1658 variables, 54/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1658 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1658 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1658/1658 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 532/532 constraints, ReadFeed: 54/54 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/517 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/532 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 03:48:38] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 03:48:38] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1126/1658 variables, 532/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1658 variables, 54/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1658 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1658 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1658 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1658/1658 variables, and 651 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2582 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 532/532 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 87 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1136/1136 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 532/532 places, 1136/1136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1136/1136 transitions.
Applied a total of 0 rules in 12 ms. Remains 532 /532 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
[2024-05-26 03:48:41] [INFO ] Flow matrix only has 1126 transitions (discarded 10 similar events)
[2024-05-26 03:48:41] [INFO ] Invariant cache hit.
[2024-05-26 03:48:41] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-26 03:48:41] [INFO ] Flow matrix only has 1126 transitions (discarded 10 similar events)
[2024-05-26 03:48:41] [INFO ] Invariant cache hit.
[2024-05-26 03:48:41] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 03:48:42] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-05-26 03:48:42] [INFO ] Redundant transitions in 62 ms returned []
Running 1130 sub problems to find dead transitions.
[2024-05-26 03:48:42] [INFO ] Flow matrix only has 1126 transitions (discarded 10 similar events)
[2024-05-26 03:48:42] [INFO ] Invariant cache hit.
[2024-05-26 03:48:42] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-26 03:49:01] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 7 ms to minimize.
[2024-05-26 03:49:01] [INFO ] Deduced a trap composed of 12 places in 410 ms of which 3 ms to minimize.
[2024-05-26 03:49:02] [INFO ] Deduced a trap composed of 20 places in 1011 ms of which 3 ms to minimize.
[2024-05-26 03:49:02] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2024-05-26 03:49:03] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2024-05-26 03:49:03] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 2 ms to minimize.
[2024-05-26 03:49:03] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-05-26 03:49:03] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-05-26 03:49:03] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 2 ms to minimize.
[2024-05-26 03:49:04] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 4 ms to minimize.
[2024-05-26 03:49:04] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2024-05-26 03:49:04] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-05-26 03:49:04] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 2 ms to minimize.
[2024-05-26 03:49:05] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 2 ms to minimize.
[2024-05-26 03:49:05] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 3 ms to minimize.
[2024-05-26 03:49:05] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-05-26 03:49:05] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 5 ms to minimize.
[2024-05-26 03:49:05] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-26 03:49:06] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 2 ms to minimize.
[2024-05-26 03:49:06] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-26 03:49:06] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-26 03:49:07] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 2 ms to minimize.
[2024-05-26 03:49:07] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 3 ms to minimize.
[2024-05-26 03:49:07] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2024-05-26 03:49:07] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-26 03:49:07] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 4 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-26 03:49:08] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-26 03:49:10] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
[2024-05-26 03:49:10] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1658 variables, and 96 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 0/532 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-26 03:49:22] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 4 ms to minimize.
[2024-05-26 03:49:22] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2024-05-26 03:49:22] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 2 ms to minimize.
[2024-05-26 03:49:23] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-26 03:49:23] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-05-26 03:49:27] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-26 03:49:28] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-26 03:49:29] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-26 03:49:31] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 3 ms to minimize.
[2024-05-26 03:49:32] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-26 03:49:36] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 4 ms to minimize.
[2024-05-26 03:49:36] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-26 03:49:37] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-26 03:49:37] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1658 variables, and 110 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 0/532 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 48/48 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61618 ms. Remains : 532/532 places, 1136/1136 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2158 edges and 532 vertex of which 528 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 528 transition count 1126
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 29 place count 519 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 43 place count 519 transition count 1103
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 519 transition count 1103
Applied a total of 52 rules in 46 ms. Remains 519 /532 variables (removed 13) and now considering 1103/1136 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1103 rows 519 cols
[2024-05-26 03:49:43] [INFO ] Computed 58 invariants in 5 ms
[2024-05-26 03:49:43] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:49:43] [INFO ] [Nat]Absence check using 58 positive place invariants in 203 ms returned sat
[2024-05-26 03:49:43] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:49:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 03:49:44] [INFO ] After 334ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 03:49:44] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:49:45] [INFO ] After 1949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2157 ms.
[2024-05-26 03:49:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2024-05-26 03:49:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 1136 transitions and 4380 arcs took 9 ms.
[2024-05-26 03:49:45] [INFO ] Flatten gal took : 227 ms
Total runtime 133516 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running NoC3x3-PT-6B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 532
TRANSITIONS: 1136
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 784
MODEL NAME: /home/mcc/execution/414/model
532 places, 1136 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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-6B"
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-6B, 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-171654350300647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B 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 ;