About the Execution of GreatSPN+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10974.056 | 3600000.00 | 11354391.00 | 8029.20 | TTTTTTTTTFFTFTT? | 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.r179-tall-171640601200303.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 FunctionPointer-PT-c016, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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 FunctionPointer-PT-c016-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2023-02
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716442243140
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 05:30:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 05:30:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:30:44] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-05-23 05:30:44] [INFO ] Transformed 2826 places.
[2024-05-23 05:30:44] [INFO ] Transformed 8960 transitions.
[2024-05-23 05:30:44] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 49 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40011 steps (8 resets) in 3288 ms. (12 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (14 resets) in 139 ms. (285 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
[2024-05-23 05:30:46] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 05:30:46] [INFO ] Computed 4 invariants in 79 ms
[2024-05-23 05:30:46] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FunctionPointer-PT-c016-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c016-ReachabilityFireability-2024-10 is UNSAT
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 535/579 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/580 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1576/2156 variables, 580/584 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 401/985 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/985 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1952/4108 variables, 520/1505 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4108 variables, 78/1583 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4108 variables, 0/1583 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 745/4853 variables, 440/2023 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4853 variables, 0/2023 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 299/5152 variables, 72/2095 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5152 variables, 0/2095 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 16/5168 variables, 16/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 2 solved, 7 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 540/570 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-23 05:30:51] [INFO ] Deduced a trap composed of 135 places in 300 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/571 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1510/2081 variables, 571/576 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2081 variables, 399/975 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2081 variables, 0/975 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1797/3878 variables, 484/1459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3878 variables, 80/1539 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3878 variables, 5/1544 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-23 05:30:54] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3878 variables, 1/1545 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3878 variables, 0/1545 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 763/4641 variables, 433/1978 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4641/5168 variables, and 1978 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1488/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 9727ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 288 place count 1324 transition count 3836
Iterating global reduction 0 with 287 rules applied. Total rules applied 575 place count 1324 transition count 3836
Ensure Unique test removed 444 transitions
Reduce isomorphic transitions removed 444 transitions.
Iterating post reduction 0 with 444 rules applied. Total rules applied 1019 place count 1324 transition count 3392
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 1162 place count 1181 transition count 3106
Iterating global reduction 1 with 143 rules applied. Total rules applied 1305 place count 1181 transition count 3106
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 1389 place count 1181 transition count 3022
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1403 place count 1167 transition count 2994
Iterating global reduction 2 with 14 rules applied. Total rules applied 1417 place count 1167 transition count 2994
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1431 place count 1153 transition count 2966
Iterating global reduction 2 with 14 rules applied. Total rules applied 1445 place count 1153 transition count 2966
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1459 place count 1139 transition count 2938
Iterating global reduction 2 with 14 rules applied. Total rules applied 1473 place count 1139 transition count 2938
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1487 place count 1125 transition count 2910
Iterating global reduction 2 with 14 rules applied. Total rules applied 1501 place count 1125 transition count 2910
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1515 place count 1111 transition count 2882
Iterating global reduction 2 with 14 rules applied. Total rules applied 1529 place count 1111 transition count 2882
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1541 place count 1099 transition count 2858
Iterating global reduction 2 with 12 rules applied. Total rules applied 1553 place count 1099 transition count 2858
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1563 place count 1089 transition count 2838
Iterating global reduction 2 with 10 rules applied. Total rules applied 1573 place count 1089 transition count 2838
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 1608 place count 1054 transition count 2708
Iterating global reduction 2 with 35 rules applied. Total rules applied 1643 place count 1054 transition count 2708
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1686 place count 1011 transition count 2536
Iterating global reduction 2 with 43 rules applied. Total rules applied 1729 place count 1011 transition count 2536
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1772 place count 968 transition count 2422
Iterating global reduction 2 with 43 rules applied. Total rules applied 1815 place count 968 transition count 2422
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1858 place count 925 transition count 2336
Iterating global reduction 2 with 43 rules applied. Total rules applied 1901 place count 925 transition count 2336
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1944 place count 882 transition count 2250
Iterating global reduction 2 with 43 rules applied. Total rules applied 1987 place count 882 transition count 2250
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2029 place count 840 transition count 2166
Iterating global reduction 2 with 42 rules applied. Total rules applied 2071 place count 840 transition count 2166
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2111 place count 800 transition count 2086
Iterating global reduction 2 with 40 rules applied. Total rules applied 2151 place count 800 transition count 2086
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2164 place count 787 transition count 2060
Iterating global reduction 2 with 13 rules applied. Total rules applied 2177 place count 787 transition count 2060
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 2219 place count 787 transition count 2018
Applied a total of 2219 rules in 2671 ms. Remains 787 /1628 variables (removed 841) and now considering 2018/5962 (removed 3944) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2681 ms. Remains : 787/1628 places, 2018/5962 transitions.
RANDOM walk for 40007 steps (8 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 213166 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 7
Probabilistic random walk after 213166 steps, saw 144140 distinct states, run finished after 3011 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-23 05:31:02] [INFO ] Flow matrix only has 1361 transitions (discarded 657 similar events)
// Phase 1: matrix 1361 rows 787 cols
[2024-05-23 05:31:02] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 05:31:02] [INFO ] State equation strengthened by 328 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1021/1430 variables, 409/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 240/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1430 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 595/2025 variables, 269/919 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 1/920 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 88/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 122/2147 variables, 108/1116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2147 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/2148 variables, 1/1117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2148 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2148 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2148/2148 variables, and 1117 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 787/787 constraints, ReadFeed: 328/328 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1021/1430 variables, 409/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 240/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1430 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 595/2025 variables, 269/919 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 1/920 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 88/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 7/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 05:31:05] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2025 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 122/2147 variables, 108/1124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2147 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/2148 variables, 1/1125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2148 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/2148 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2148/2148 variables, and 1125 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 787/787 constraints, ReadFeed: 328/328 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 6765ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 6522 ms.
Support contains 6 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 2018/2018 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 771 transition count 1970
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 771 transition count 1970
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 771 transition count 1962
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 753 transition count 1926
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 753 transition count 1926
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 753 transition count 1918
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 739 transition count 1874
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 739 transition count 1874
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 724 transition count 1838
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 724 transition count 1838
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 159 place count 707 transition count 1796
Iterating global reduction 2 with 17 rules applied. Total rules applied 176 place count 707 transition count 1796
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 193 place count 690 transition count 1762
Iterating global reduction 2 with 17 rules applied. Total rules applied 210 place count 690 transition count 1762
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 226 place count 674 transition count 1730
Iterating global reduction 2 with 16 rules applied. Total rules applied 242 place count 674 transition count 1730
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 257 place count 659 transition count 1700
Iterating global reduction 2 with 15 rules applied. Total rules applied 272 place count 659 transition count 1700
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 287 place count 644 transition count 1670
Iterating global reduction 2 with 15 rules applied. Total rules applied 302 place count 644 transition count 1670
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 309 place count 637 transition count 1656
Iterating global reduction 2 with 7 rules applied. Total rules applied 316 place count 637 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 320 place count 633 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 324 place count 633 transition count 1648
Applied a total of 324 rules in 274 ms. Remains 633 /787 variables (removed 154) and now considering 1648/2018 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 633/787 places, 1648/2018 transitions.
RANDOM walk for 40020 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 229686 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 229686 steps, saw 149097 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-23 05:31:18] [INFO ] Flow matrix only has 1103 transitions (discarded 545 similar events)
// Phase 1: matrix 1103 rows 633 cols
[2024-05-23 05:31:18] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 05:31:18] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 553/559 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/559 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 968/1527 variables, 487/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1527 variables, 273/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1527 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1589 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1589 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 142/1731 variables, 137/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/1735 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/1736 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1736 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1736/1736 variables, and 908 constraints, problems are : Problem set: 0 solved, 4 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 273/273 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 553/559 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/559 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 968/1527 variables, 487/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1527 variables, 273/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1527 variables, 4/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1527 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/1589 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:31:20] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1589 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1589 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 142/1731 variables, 137/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/1735 variables, 2/912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1735 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1736 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1736 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1736 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1736/1736 variables, and 913 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3564ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2023-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2910 ms.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 630 transition count 1642
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 630 transition count 1642
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 630 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 627 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 627 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 624 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 624 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 621 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 621 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 618 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 618 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 615 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 615 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 612 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 612 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 609 transition count 1592
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 609 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 607 transition count 1588
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 607 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 606 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 606 transition count 1586
Applied a total of 56 rules in 355 ms. Remains 606 /633 variables (removed 27) and now considering 1586/1648 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 606/633 places, 1586/1648 transitions.
RANDOM walk for 40016 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 551781 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 551781 steps, saw 358138 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 05:31:28] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
// Phase 1: matrix 1060 rows 606 cols
[2024-05-23 05:31:28] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 05:31:28] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1520 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1521 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 131/1652 variables, 129/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1520 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1521 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:31:29] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1521 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1521 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 131/1652 variables, 129/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1652 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1660 variables, 4/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1660 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1666 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1666 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1666 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 68 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 606/606 places, 1586/1586 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 70 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2024-05-23 05:31:30] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 05:31:30] [INFO ] Invariant cache hit.
[2024-05-23 05:31:31] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-23 05:31:31] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 05:31:31] [INFO ] Invariant cache hit.
[2024-05-23 05:31:31] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 05:31:32] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2024-05-23 05:31:32] [INFO ] Redundant transitions in 86 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-23 05:31:32] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 05:31:32] [INFO ] Invariant cache hit.
[2024-05-23 05:31:32] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 264/872 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 2456 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 31383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 68361ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 68385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70661 ms. Remains : 606/606 places, 1586/1586 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 932 edges and 606 vertex of which 192 / 606 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 478 transition count 858
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 468 transition count 858
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 21 place count 468 transition count 790
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 157 place count 400 transition count 790
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 220 place count 337 transition count 727
Iterating global reduction 2 with 63 rules applied. Total rules applied 283 place count 337 transition count 727
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 409 place count 337 transition count 601
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 665 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 729 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 793 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 794 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 859 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 922 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 985 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1048 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1111 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1111 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 17 transition count 27
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 1115 place count 17 transition count 25
Applied a total of 1115 rules in 125 ms. Remains 17 /606 variables (removed 589) and now considering 25/1586 (removed 1561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-23 05:32:41] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 05:32:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:32:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:32:41] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:32:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:32:41] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:32:41] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:32:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:32:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:32:41] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:32:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:32:41] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:32:41] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 263 ms.
[2024-05-23 05:32:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-23 05:32:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 1586 transitions and 6470 arcs took 10 ms.
[2024-05-23 05:32:41] [INFO ] Flatten gal took : 127 ms
Total runtime 117575 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c016
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: 606
TRANSITIONS: 1586
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.003s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 613
MODEL NAME: /home/mcc/execution/414/model
606 places, 1586 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
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="FunctionPointer-PT-c016"
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 FunctionPointer-PT-c016, 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 r179-tall-171640601200303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 ;