About the Execution of LTSMin+red for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4243.168 | 133955.00 | 209974.00 | 318.00 | F?F??TFT?F?TT?FF | 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-171640603200327.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-c128, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603200327
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 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-c128-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717195478231
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-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:44:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:44:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:44:39] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2024-05-31 22:44:39] [INFO ] Transformed 2826 places.
[2024-05-31 22:44:39] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:44:39] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 45 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40022 steps (8 resets) in 2398 ms. (16 steps per ms) remains 12/13 properties
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 117190 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 12
Probabilistic random walk after 117190 steps, saw 95669 distinct states, run finished after 3006 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-31 22:44:44] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:44:44] [INFO ] Computed 4 invariants in 101 ms
[2024-05-31 22:44:44] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FunctionPointer-PT-c128-ReachabilityFireability-2024-00 is UNSAT
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c128-ReachabilityFireability-2024-02 is UNSAT
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c128-ReachabilityFireability-2024-12 is UNSAT
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 528/594 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/595 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1640/2235 variables, 595/599 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2235 variables, 401/1000 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2235 variables, 0/1000 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2014/4249 variables, 540/1540 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4249 variables, 78/1618 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4249 variables, 0/1618 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 711/4960 variables, 429/2047 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4960 variables, 0/2047 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 200/5160 variables, 56/2103 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5160 variables, 0/2103 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 8/5168 variables, 8/2111 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 3 solved, 9 unsolved in 4053 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: 12/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 541/569 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/570 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1513/2083 variables, 570/575 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2083 variables, 399/974 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2083 variables, 0/974 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1973/4056 variables, 500/1474 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4056 variables, 80/1554 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4056 variables, 7/1561 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-31 22:44:51] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4056 variables, 1/1562 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4056 variables, 0/1562 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 720/4776 variables, 454/2016 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4776/5168 variables, and 2016 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1524/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 9597ms problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 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 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 289 place count 1323 transition count 3836
Iterating global reduction 0 with 288 rules applied. Total rules applied 577 place count 1323 transition count 3836
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Iterating post reduction 0 with 448 rules applied. Total rules applied 1025 place count 1323 transition count 3388
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 1171 place count 1177 transition count 3096
Iterating global reduction 1 with 146 rules applied. Total rules applied 1317 place count 1177 transition count 3096
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 1421 place count 1177 transition count 2992
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1433 place count 1165 transition count 2968
Iterating global reduction 2 with 12 rules applied. Total rules applied 1445 place count 1165 transition count 2968
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1457 place count 1153 transition count 2944
Iterating global reduction 2 with 12 rules applied. Total rules applied 1469 place count 1153 transition count 2944
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1481 place count 1141 transition count 2920
Iterating global reduction 2 with 12 rules applied. Total rules applied 1493 place count 1141 transition count 2920
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1505 place count 1129 transition count 2896
Iterating global reduction 2 with 12 rules applied. Total rules applied 1517 place count 1129 transition count 2896
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1529 place count 1117 transition count 2872
Iterating global reduction 2 with 12 rules applied. Total rules applied 1541 place count 1117 transition count 2872
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1550 place count 1108 transition count 2854
Iterating global reduction 2 with 9 rules applied. Total rules applied 1559 place count 1108 transition count 2854
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1567 place count 1100 transition count 2838
Iterating global reduction 2 with 8 rules applied. Total rules applied 1575 place count 1100 transition count 2838
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1604 place count 1071 transition count 2730
Iterating global reduction 2 with 29 rules applied. Total rules applied 1633 place count 1071 transition count 2730
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1671 place count 1033 transition count 2578
Iterating global reduction 2 with 38 rules applied. Total rules applied 1709 place count 1033 transition count 2578
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1747 place count 995 transition count 2476
Iterating global reduction 2 with 38 rules applied. Total rules applied 1785 place count 995 transition count 2476
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1823 place count 957 transition count 2400
Iterating global reduction 2 with 38 rules applied. Total rules applied 1861 place count 957 transition count 2400
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1898 place count 920 transition count 2326
Iterating global reduction 2 with 37 rules applied. Total rules applied 1935 place count 920 transition count 2326
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 1972 place count 883 transition count 2252
Iterating global reduction 2 with 37 rules applied. Total rules applied 2009 place count 883 transition count 2252
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 2046 place count 846 transition count 2178
Iterating global reduction 2 with 37 rules applied. Total rules applied 2083 place count 846 transition count 2178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2096 place count 833 transition count 2152
Iterating global reduction 2 with 13 rules applied. Total rules applied 2109 place count 833 transition count 2152
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 2 with 52 rules applied. Total rules applied 2161 place count 833 transition count 2100
Applied a total of 2161 rules in 1644 ms. Remains 833 /1628 variables (removed 795) and now considering 2100/5962 (removed 3862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1660 ms. Remains : 833/1628 places, 2100/5962 transitions.
RANDOM walk for 40051 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 210394 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 9
Probabilistic random walk after 210394 steps, saw 136578 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 22:44:58] [INFO ] Flow matrix only has 1422 transitions (discarded 678 similar events)
// Phase 1: matrix 1422 rows 833 cols
[2024-05-31 22:44:58] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 22:44:58] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 381/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 55/464 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1071/1535 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1535 variables, 275/741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1535 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 558/2093 variables, 241/982 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2093 variables, 68/1050 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2093 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 153/2246 variables, 122/1172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2246 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/2252 variables, 4/1176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2252 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 3/2255 variables, 2/1178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2255 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/2255 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2255/2255 variables, and 1178 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 833/833 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 381/409 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 55/464 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1071/1535 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1535 variables, 275/741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1535 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 558/2093 variables, 241/982 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2093 variables, 68/1050 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2093 variables, 9/1059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2093 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 153/2246 variables, 122/1181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2246 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 6/2252 variables, 4/1185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2252 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 3/2255 variables, 2/1187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2255 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/2255 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2255/2255 variables, and 1187 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 833/833 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7466ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 14121 ms.
Support contains 20 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 2100/2100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 828 transition count 2090
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 828 transition count 2090
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 828 transition count 2084
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 823 transition count 2074
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 823 transition count 2074
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 818 transition count 2060
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 818 transition count 2060
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 807 transition count 2022
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 807 transition count 2022
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 796 transition count 2000
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 796 transition count 2000
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 785 transition count 1978
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 785 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 775 transition count 1958
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 775 transition count 1958
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 132 place count 765 transition count 1938
Iterating global reduction 1 with 10 rules applied. Total rules applied 142 place count 765 transition count 1938
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 152 place count 755 transition count 1918
Iterating global reduction 1 with 10 rules applied. Total rules applied 162 place count 755 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 172 place count 745 transition count 1894
Iterating global reduction 1 with 10 rules applied. Total rules applied 182 place count 745 transition count 1894
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 743 transition count 1890
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 743 transition count 1890
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 741 transition count 1886
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 741 transition count 1886
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 739 transition count 1882
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 739 transition count 1882
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 196 place count 737 transition count 1878
Iterating global reduction 1 with 2 rules applied. Total rules applied 198 place count 737 transition count 1878
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 200 place count 735 transition count 1874
Iterating global reduction 1 with 2 rules applied. Total rules applied 202 place count 735 transition count 1874
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 204 place count 733 transition count 1870
Iterating global reduction 1 with 2 rules applied. Total rules applied 206 place count 733 transition count 1870
Applied a total of 206 rules in 395 ms. Remains 733 /833 variables (removed 100) and now considering 1870/2100 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 733/833 places, 1870/2100 transitions.
RANDOM walk for 40029 steps (8 resets) in 115 ms. (345 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 272108 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 6
Probabilistic random walk after 272108 steps, saw 176628 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-31 22:45:23] [INFO ] Flow matrix only has 1260 transitions (discarded 610 similar events)
// Phase 1: matrix 1260 rows 733 cols
[2024-05-31 22:45:23] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 22:45:23] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/434 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 977/1411 variables, 434/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1411 variables, 240/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 469/1880 variables, 199/875 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1880 variables, 67/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1880 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 106/1986 variables, 96/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1986 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 4/1990 variables, 2/1040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1990 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/1993 variables, 2/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1993 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1993 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1993/1993 variables, and 1042 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 733/733 constraints, ReadFeed: 307/307 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/434 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 977/1411 variables, 434/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1411 variables, 240/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 469/1880 variables, 199/875 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1880 variables, 67/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1880 variables, 6/948 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1880 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 106/1986 variables, 96/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1986 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 4/1990 variables, 2/1046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1990 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 3/1993 variables, 2/1048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1993 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1993 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1993/1993 variables, and 1048 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 733/733 constraints, ReadFeed: 307/307 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 4598ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 9250 ms.
Support contains 20 out of 733 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 733/733 places, 1870/1870 transitions.
Applied a total of 0 rules in 101 ms. Remains 733 /733 variables (removed 0) and now considering 1870/1870 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 733/733 places, 1870/1870 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 733/733 places, 1870/1870 transitions.
Applied a total of 0 rules in 102 ms. Remains 733 /733 variables (removed 0) and now considering 1870/1870 (removed 0) transitions.
[2024-05-31 22:45:38] [INFO ] Flow matrix only has 1260 transitions (discarded 610 similar events)
[2024-05-31 22:45:38] [INFO ] Invariant cache hit.
[2024-05-31 22:45:38] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-31 22:45:38] [INFO ] Flow matrix only has 1260 transitions (discarded 610 similar events)
[2024-05-31 22:45:38] [INFO ] Invariant cache hit.
[2024-05-31 22:45:38] [INFO ] State equation strengthened by 307 read => feed constraints.
[2024-05-31 22:45:40] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2024-05-31 22:45:40] [INFO ] Redundant transitions in 104 ms returned []
Running 1868 sub problems to find dead transitions.
[2024-05-31 22:45:40] [INFO ] Flow matrix only has 1260 transitions (discarded 610 similar events)
[2024-05-31 22:45:40] [INFO ] Invariant cache hit.
[2024-05-31 22:45:40] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/733 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/733 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1868 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 733/1993 variables, and 2 constraints, problems are : Problem set: 0 solved, 1868 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/733 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1868/1868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/733 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/733 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/733 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
At refinement iteration 3 (OVERLAPS) 1260/1993 variables, 733/735 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1993 variables, 307/1042 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1993/1993 variables, and 2910 constraints, problems are : Problem set: 0 solved, 1868 unsolved in 31851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 733/733 constraints, ReadFeed: 307/307 constraints, PredecessorRefiner: 1868/1868 constraints, Known Traps: 0/0 constraints]
After SMT, in 70377ms problems are : Problem set: 0 solved, 1868 unsolved
Search for dead transitions found 0 dead transitions in 70394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72987 ms. Remains : 733/733 places, 1870/1870 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1101 edges and 733 vertex of which 192 / 733 are part of one of the 64 SCC in 3 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 802 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 605 transition count 1047
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 584 transition count 1046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 583 transition count 1046
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 45 place count 583 transition count 935
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 267 place count 472 transition count 935
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 330 place count 409 transition count 872
Iterating global reduction 3 with 63 rules applied. Total rules applied 393 place count 409 transition count 872
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 3 with 126 rules applied. Total rules applied 519 place count 409 transition count 746
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 4 with 264 rules applied. Total rules applied 783 place count 277 transition count 614
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 846 place count 214 transition count 488
Iterating global reduction 4 with 63 rules applied. Total rules applied 909 place count 214 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 911 place count 214 transition count 486
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 973 place count 152 transition count 362
Iterating global reduction 5 with 62 rules applied. Total rules applied 1035 place count 152 transition count 362
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 1097 place count 90 transition count 238
Iterating global reduction 5 with 62 rules applied. Total rules applied 1159 place count 90 transition count 238
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 1221 place count 90 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1223 place count 89 transition count 175
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1247 place count 77 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1253 place count 77 transition count 170
Applied a total of 1253 rules in 114 ms. Remains 77 /733 variables (removed 656) and now considering 170/1870 (removed 1700) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 170 rows 77 cols
[2024-05-31 22:46:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:46:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:46:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:46:51] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 22:46:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:46:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:46:51] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 22:46:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:46:51] [INFO ] After 58ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-31 22:46:51] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-31 22:46:51] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 608 ms.
[2024-05-31 22:46:51] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 22:46:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 733 places, 1870 transitions and 7606 arcs took 11 ms.
[2024-05-31 22:46:51] [INFO ] Flatten gal took : 145 ms
Total runtime 132568 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-c128-ReachabilityFireability-2024-01
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityFireability-2024-03
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityFireability-2024-04
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityFireability-2024-08
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityFireability-2024-10
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityFireability-2024-13
BK_STOP 1717195612186
--------------------
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-c128-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_0_
rfs formula name FunctionPointer-PT-c128-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_1_
rfs formula name FunctionPointer-PT-c128-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_2_
rfs formula name FunctionPointer-PT-c128-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_3_
rfs formula name FunctionPointer-PT-c128-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_4_
rfs formula name FunctionPointer-PT-c128-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/563/inv_5_
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-c128"
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-c128, 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-171640603200327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 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 ;