About the Execution of LTSMin+red for FunctionPointer-PT-c032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4341.628 | 117214.00 | 175681.00 | 203.60 | F?TTFFT?TTTTFFFF | 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.r496-tall-171640603100311.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 ltsminxred
Input is FunctionPointer-PT-c032, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100311
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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-c032-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2023-01
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717193998182
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:19:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:19:59] [INFO ] Load time of PNML (sax parser for PT used): 394 ms
[2024-05-31 22:19:59] [INFO ] Transformed 2826 places.
[2024-05-31 22:19:59] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:19:59] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 557 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 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40026 steps (8 resets) in 3004 ms. (13 steps per ms) remains 8/10 properties
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 869 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
[2024-05-31 22:20:01] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:20:01] [INFO ] Computed 4 invariants in 98 ms
[2024-05-31 22:20:01] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FunctionPointer-PT-c032-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 532/590 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/591 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1598/2189 variables, 591/595 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2189 variables, 407/1002 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2189 variables, 0/1002 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2004/4193 variables, 523/1525 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4193 variables, 72/1597 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4193 variables, 0/1597 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 669/4862 variables, 434/2031 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4862 variables, 0/2031 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 220/5082 variables, 58/2089 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5082 variables, 0/2089 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 86/5168 variables, 22/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3778 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: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 535/586 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/587 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1569/2156 variables, 587/591 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 406/997 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/997 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1916/4072 variables, 505/1502 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4072 variables, 73/1575 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4072 variables, 5/1580 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 22:20:08] [INFO ] Deduced a trap composed of 131 places in 254 ms of which 30 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4072 variables, 1/1581 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4072 variables, 0/1581 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 682/4754 variables, 431/2012 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4754/5168 variables, and 2012 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1523/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 9399ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 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.15 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 284 place count 1328 transition count 3888
Iterating global reduction 0 with 283 rules applied. Total rules applied 567 place count 1328 transition count 3888
Ensure Unique test removed 472 transitions
Reduce isomorphic transitions removed 472 transitions.
Iterating post reduction 0 with 472 rules applied. Total rules applied 1039 place count 1328 transition count 3416
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 1182 place count 1185 transition count 3130
Iterating global reduction 1 with 143 rules applied. Total rules applied 1325 place count 1185 transition count 3130
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 1437 place count 1185 transition count 3018
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1451 place count 1171 transition count 2990
Iterating global reduction 2 with 14 rules applied. Total rules applied 1465 place count 1171 transition count 2990
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1478 place count 1158 transition count 2964
Iterating global reduction 2 with 13 rules applied. Total rules applied 1491 place count 1158 transition count 2964
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1504 place count 1145 transition count 2938
Iterating global reduction 2 with 13 rules applied. Total rules applied 1517 place count 1145 transition count 2938
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1529 place count 1133 transition count 2914
Iterating global reduction 2 with 12 rules applied. Total rules applied 1541 place count 1133 transition count 2914
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1553 place count 1121 transition count 2890
Iterating global reduction 2 with 12 rules applied. Total rules applied 1565 place count 1121 transition count 2890
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1574 place count 1112 transition count 2872
Iterating global reduction 2 with 9 rules applied. Total rules applied 1583 place count 1112 transition count 2872
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1592 place count 1103 transition count 2854
Iterating global reduction 2 with 9 rules applied. Total rules applied 1601 place count 1103 transition count 2854
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 1625 place count 1079 transition count 2770
Iterating global reduction 2 with 24 rules applied. Total rules applied 1649 place count 1079 transition count 2770
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1689 place count 1039 transition count 2610
Iterating global reduction 2 with 40 rules applied. Total rules applied 1729 place count 1039 transition count 2610
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 1768 place count 1000 transition count 2486
Iterating global reduction 2 with 39 rules applied. Total rules applied 1807 place count 1000 transition count 2486
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1844 place count 963 transition count 2412
Iterating global reduction 2 with 37 rules applied. Total rules applied 1881 place count 963 transition count 2412
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1918 place count 926 transition count 2338
Iterating global reduction 2 with 37 rules applied. Total rules applied 1955 place count 926 transition count 2338
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1992 place count 889 transition count 2264
Iterating global reduction 2 with 37 rules applied. Total rules applied 2029 place count 889 transition count 2264
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 2065 place count 853 transition count 2192
Iterating global reduction 2 with 36 rules applied. Total rules applied 2101 place count 853 transition count 2192
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 2121 place count 833 transition count 2152
Iterating global reduction 2 with 20 rules applied. Total rules applied 2141 place count 833 transition count 2152
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 2 with 50 rules applied. Total rules applied 2191 place count 833 transition count 2102
Applied a total of 2191 rules in 1619 ms. Remains 833 /1628 variables (removed 795) and now considering 2102/5962 (removed 3860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1633 ms. Remains : 833/1628 places, 2102/5962 transitions.
RANDOM walk for 40031 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
[2024-05-31 22:20:12] [INFO ] Flow matrix only has 1425 transitions (discarded 677 similar events)
// Phase 1: matrix 1425 rows 833 cols
[2024-05-31 22:20:12] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 22:20:12] [INFO ] State equation strengthened by 345 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 376/424 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 54/478 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1104/1582 variables, 478/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1582 variables, 285/765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1582 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 551/2133 variables, 244/1009 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2133 variables, 60/1069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2133 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 124/2257 variables, 110/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2257 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/2258 variables, 1/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2258 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2258 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2258/2258 variables, and 1180 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 833/833 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 376/424 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 54/478 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1104/1582 variables, 478/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1582 variables, 285/765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1582 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 551/2133 variables, 244/1009 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2133 variables, 60/1069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2133 variables, 6/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2133 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 124/2257 variables, 110/1185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2257 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/2258 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2258 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2258 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2258/2258 variables, and 1186 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 833/833 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 5295ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 5934 ms.
Support contains 28 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 2102/2102 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 819 transition count 2070
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 819 transition count 2070
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 819 transition count 2066
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 805 transition count 2038
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 805 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 795 transition count 2010
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 795 transition count 2010
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 786 transition count 1992
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 786 transition count 1992
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 107 place count 777 transition count 1974
Iterating global reduction 1 with 9 rules applied. Total rules applied 116 place count 777 transition count 1974
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 124 place count 769 transition count 1958
Iterating global reduction 1 with 8 rules applied. Total rules applied 132 place count 769 transition count 1958
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 138 place count 763 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 763 transition count 1946
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 754 transition count 1918
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 754 transition count 1918
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 745 transition count 1900
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 745 transition count 1900
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 185 place count 740 transition count 1890
Iterating global reduction 1 with 5 rules applied. Total rules applied 190 place count 740 transition count 1890
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 735 transition count 1880
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 735 transition count 1880
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 205 place count 730 transition count 1870
Iterating global reduction 1 with 5 rules applied. Total rules applied 210 place count 730 transition count 1870
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 215 place count 725 transition count 1860
Iterating global reduction 1 with 5 rules applied. Total rules applied 220 place count 725 transition count 1860
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 225 place count 720 transition count 1850
Iterating global reduction 1 with 5 rules applied. Total rules applied 230 place count 720 transition count 1850
Applied a total of 230 rules in 354 ms. Remains 720 /833 variables (removed 113) and now considering 1850/2102 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 720/833 places, 1850/2102 transitions.
RANDOM walk for 40081 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 222136 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 222136 steps, saw 144197 distinct states, run finished after 3014 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-31 22:20:27] [INFO ] Flow matrix only has 1246 transitions (discarded 604 similar events)
// Phase 1: matrix 1246 rows 720 cols
[2024-05-31 22:20:27] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 22:20:27] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 378/406 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/436 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 978/1414 variables, 436/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 242/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 456/1870 variables, 194/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1870 variables, 63/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1870 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 96/1966 variables, 90/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1966 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 1027 constraints, problems are : Problem set: 0 solved, 4 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 720/720 constraints, ReadFeed: 305/305 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 378/406 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/436 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 978/1414 variables, 436/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 242/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 456/1870 variables, 194/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1870 variables, 63/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1870 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:29] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1870 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1870 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 96/1966 variables, 90/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1966 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1966 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 1032 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 720/720 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3720ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2883 ms.
Support contains 25 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 1850/1850 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 717 transition count 1844
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 717 transition count 1844
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 717 transition count 1840
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 714 transition count 1834
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 714 transition count 1834
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 712 transition count 1828
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 712 transition count 1828
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 710 transition count 1822
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 710 transition count 1822
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 708 transition count 1818
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 708 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 706 transition count 1814
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 706 transition count 1814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 704 transition count 1810
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 704 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 702 transition count 1806
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 702 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 700 transition count 1802
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 700 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 699 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 699 transition count 1800
Applied a total of 46 rules in 239 ms. Remains 699 /720 variables (removed 21) and now considering 1800/1850 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 699/720 places, 1800/1850 transitions.
RANDOM walk for 40016 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 330778 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 330778 steps, saw 214707 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-31 22:20:37] [INFO ] Flow matrix only has 1211 transitions (discarded 589 similar events)
// Phase 1: matrix 1211 rows 699 cols
[2024-05-31 22:20:37] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 22:20:37] [INFO ] State equation strengthened by 297 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 378/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/429 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 956/1385 variables, 429/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1385 variables, 234/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1385 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 433/1818 variables, 184/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1818 variables, 63/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1818 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 92/1910 variables, 86/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1910 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1910 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1910/1910 variables, and 998 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 699/699 constraints, ReadFeed: 297/297 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 378/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/429 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 956/1385 variables, 429/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1385 variables, 234/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1385 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 433/1818 variables, 184/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1818 variables, 63/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1818 variables, 2/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1818 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1818 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 92/1910 variables, 86/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1910 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1910 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1910/1910 variables, and 1001 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 699/699 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2565ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1226 ms.
Support contains 25 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1800/1800 transitions.
Applied a total of 0 rules in 79 ms. Remains 699 /699 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 699/699 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1800/1800 transitions.
Applied a total of 0 rules in 82 ms. Remains 699 /699 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-31 22:20:41] [INFO ] Flow matrix only has 1211 transitions (discarded 589 similar events)
[2024-05-31 22:20:41] [INFO ] Invariant cache hit.
[2024-05-31 22:20:41] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-31 22:20:41] [INFO ] Flow matrix only has 1211 transitions (discarded 589 similar events)
[2024-05-31 22:20:41] [INFO ] Invariant cache hit.
[2024-05-31 22:20:42] [INFO ] State equation strengthened by 297 read => feed constraints.
[2024-05-31 22:20:43] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2252 ms to find 0 implicit places.
[2024-05-31 22:20:43] [INFO ] Redundant transitions in 96 ms returned []
Running 1798 sub problems to find dead transitions.
[2024-05-31 22:20:43] [INFO ] Flow matrix only has 1211 transitions (discarded 589 similar events)
[2024-05-31 22:20:44] [INFO ] Invariant cache hit.
[2024-05-31 22:20:44] [INFO ] State equation strengthened by 297 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/1910 variables, and 2 constraints, problems are : Problem set: 0 solved, 1798 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/699 constraints, ReadFeed: 0/297 constraints, PredecessorRefiner: 1798/1798 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
At refinement iteration 3 (OVERLAPS) 1211/1910 variables, 699/701 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1910 variables, 297/998 constraints. Problems are: Problem set: 0 solved, 1798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1910/1910 variables, and 2796 constraints, problems are : Problem set: 0 solved, 1798 unsolved in 31902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 699/699 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 1798/1798 constraints, Known Traps: 0/0 constraints]
After SMT, in 70175ms problems are : Problem set: 0 solved, 1798 unsolved
Search for dead transitions found 0 dead transitions in 70194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72644 ms. Remains : 699/699 places, 1800/1800 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1021 edges and 699 vertex of which 183 / 699 are part of one of the 61 SCC in 4 ms
Free SCC test removed 122 places
Drop transitions (Empty/Sink Transition effects.) removed 305 transitions
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 772 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 577 transition count 1013
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 562 transition count 1011
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 560 transition count 1011
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 35 place count 560 transition count 911
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 235 place count 460 transition count 911
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 295 place count 400 transition count 851
Iterating global reduction 3 with 60 rules applied. Total rules applied 355 place count 400 transition count 851
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 475 place count 400 transition count 731
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 725 place count 275 transition count 606
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 788 place count 212 transition count 480
Iterating global reduction 4 with 63 rules applied. Total rules applied 851 place count 212 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 854 place count 212 transition count 477
Discarding 61 places :
Symmetric choice reduction at 5 with 61 rule applications. Total rules 915 place count 151 transition count 355
Iterating global reduction 5 with 61 rules applied. Total rules applied 976 place count 151 transition count 355
Discarding 60 places :
Symmetric choice reduction at 5 with 60 rule applications. Total rules 1036 place count 91 transition count 235
Iterating global reduction 5 with 60 rules applied. Total rules applied 1096 place count 91 transition count 235
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 1149 place count 91 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1151 place count 90 transition count 181
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1169 place count 81 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1172 place count 81 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 1192 place count 81 transition count 177
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 80 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 80 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1199 place count 80 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1200 place count 80 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1201 place count 79 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1202 place count 79 transition count 169
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1204 place count 79 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1205 place count 79 transition count 168
Applied a total of 1205 rules in 113 ms. Remains 79 /699 variables (removed 620) and now considering 168/1800 (removed 1632) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 79 cols
[2024-05-31 22:21:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:21:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 22:21:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:54] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-31 22:21:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:21:54] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:54] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 22:21:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:21:54] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:54] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:21:54] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:54] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 523 ms.
[2024-05-31 22:21:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 22:21:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 699 places, 1800 transitions and 7326 arcs took 14 ms.
[2024-05-31 22:21:55] [INFO ] Flatten gal took : 154 ms
Total runtime 115662 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-c032-ReachabilityFireability-2023-01
Could not compute solution for formula : FunctionPointer-PT-c032-ReachabilityFireability-2024-07
BK_STOP 1717194115396
--------------------
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
mcc2024
rfs formula name FunctionPointer-PT-c032-ReachabilityFireability-2023-01
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_0_
rfs formula name FunctionPointer-PT-c032-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-c032"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c032, 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 r496-tall-171640603100311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 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 ;