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 |
| 6440.600 | 187553.00 | 307945.00 | 280.80 | ?FFFF?F?T??FFTTT | 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-171640603200326.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603200326
=====================================================================
--------------------
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-ReachabilityCardinality-2023-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2023-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2023-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717195369194
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:42:50] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-05-31 22:42:50] [INFO ] Transformed 2826 places.
[2024-05-31 22:42:50] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:42:50] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1833 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 293 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (18 resets) in 185 ms. (215 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 910 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
[2024-05-31 22:42:52] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:42:52] [INFO ] Computed 4 invariants in 88 ms
[2024-05-31 22:42:52] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 519/596 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/598 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/599 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1577/2176 variables, 599/603 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2176 variables, 410/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2176 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1967/4143 variables, 515/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4143 variables, 69/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4143 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 634/4777 variables, 424/2021 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/2021 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 306/5083 variables, 61/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5083 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 85/5168 variables, 29/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4647 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/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 519/596 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/598 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/599 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1577/2176 variables, 599/603 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2176 variables, 410/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2176 variables, 1/1014 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2176 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1967/4143 variables, 515/1529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4143 variables, 69/1598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4143 variables, 7/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4143 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 634/4777 variables, 424/2029 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4777 variables, 0/2029 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 306/5083 variables, 61/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5083 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 85/5168 variables, 29/2119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2119 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5019 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/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 9927ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 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 1457 are kept as prefixes of interest. Removing 171 places using SCC suffix rule.13 ms
Discarding 171 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 321 transitions
Reduce isomorphic transitions removed 321 transitions.
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 1457 transition count 5641
Discarding 279 places :
Symmetric choice reduction at 1 with 279 rule applications. Total rules 601 place count 1178 transition count 3497
Iterating global reduction 1 with 279 rules applied. Total rules applied 880 place count 1178 transition count 3497
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Iterating post reduction 1 with 404 rules applied. Total rules applied 1284 place count 1178 transition count 3093
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 1426 place count 1036 transition count 2809
Iterating global reduction 2 with 142 rules applied. Total rules applied 1568 place count 1036 transition count 2809
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1652 place count 1036 transition count 2725
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1662 place count 1026 transition count 2705
Iterating global reduction 3 with 10 rules applied. Total rules applied 1672 place count 1026 transition count 2705
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1682 place count 1016 transition count 2685
Iterating global reduction 3 with 10 rules applied. Total rules applied 1692 place count 1016 transition count 2685
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1701 place count 1007 transition count 2667
Iterating global reduction 3 with 9 rules applied. Total rules applied 1710 place count 1007 transition count 2667
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1718 place count 999 transition count 2651
Iterating global reduction 3 with 8 rules applied. Total rules applied 1726 place count 999 transition count 2651
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1734 place count 991 transition count 2635
Iterating global reduction 3 with 8 rules applied. Total rules applied 1742 place count 991 transition count 2635
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1748 place count 985 transition count 2623
Iterating global reduction 3 with 6 rules applied. Total rules applied 1754 place count 985 transition count 2623
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1759 place count 980 transition count 2613
Iterating global reduction 3 with 5 rules applied. Total rules applied 1764 place count 980 transition count 2613
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1780 place count 964 transition count 2555
Iterating global reduction 3 with 16 rules applied. Total rules applied 1796 place count 964 transition count 2555
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1821 place count 939 transition count 2455
Iterating global reduction 3 with 25 rules applied. Total rules applied 1846 place count 939 transition count 2455
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1871 place count 914 transition count 2379
Iterating global reduction 3 with 25 rules applied. Total rules applied 1896 place count 914 transition count 2379
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1918 place count 892 transition count 2335
Iterating global reduction 3 with 22 rules applied. Total rules applied 1940 place count 892 transition count 2335
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1959 place count 873 transition count 2297
Iterating global reduction 3 with 19 rules applied. Total rules applied 1978 place count 873 transition count 2297
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1997 place count 854 transition count 2259
Iterating global reduction 3 with 19 rules applied. Total rules applied 2016 place count 854 transition count 2259
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2034 place count 836 transition count 2223
Iterating global reduction 3 with 18 rules applied. Total rules applied 2052 place count 836 transition count 2223
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2063 place count 825 transition count 2201
Iterating global reduction 3 with 11 rules applied. Total rules applied 2074 place count 825 transition count 2201
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 2152 place count 825 transition count 2123
Applied a total of 2152 rules in 1433 ms. Remains 825 /1628 variables (removed 803) and now considering 2123/5962 (removed 3839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1444 ms. Remains : 825/1628 places, 2123/5962 transitions.
RANDOM walk for 40038 steps (8 resets) in 346 ms. (115 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
[2024-05-31 22:43:03] [INFO ] Flow matrix only has 1355 transitions (discarded 768 similar events)
// Phase 1: matrix 1355 rows 825 cols
[2024-05-31 22:43:04] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:43:04] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 365/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 87/527 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 986/1513 variables, 527/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1513 variables, 57/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1513 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 447/1960 variables, 157/743 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 189/932 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 213/2173 variables, 136/1068 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2173 variables, 2/1070 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2173 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 6/2179 variables, 4/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2179 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/2180 variables, 1/1075 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2180 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/2180 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1075 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 825/825 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 365/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 87/527 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 986/1513 variables, 527/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1513 variables, 57/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1513 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 447/1960 variables, 157/743 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 189/932 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 213/2173 variables, 136/1075 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2173 variables, 2/1077 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2173 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/2179 variables, 4/1081 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2179 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/2180 variables, 1/1082 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2180 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/2180 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2180/2180 variables, and 1082 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 825/825 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 5119ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 42242 ms.
Support contains 65 out of 825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 825/825 places, 2123/2123 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 821 transition count 2113
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 821 transition count 2113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 821 transition count 2109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 818 transition count 2103
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 818 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 815 transition count 2095
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 815 transition count 2095
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 809 transition count 2075
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 809 transition count 2075
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 803 transition count 2063
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 803 transition count 2063
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 798 transition count 2053
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 798 transition count 2053
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 793 transition count 2043
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 793 transition count 2043
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 789 transition count 2035
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 789 transition count 2035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 785 transition count 2027
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 785 transition count 2027
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 783 transition count 2023
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 783 transition count 2023
Applied a total of 88 rules in 419 ms. Remains 783 /825 variables (removed 42) and now considering 2023/2123 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 783/825 places, 2023/2123 transitions.
RANDOM walk for 40015 steps (8 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 195453 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 5
Probabilistic random walk after 195453 steps, saw 119865 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-31 22:43:55] [INFO ] Flow matrix only has 1287 transitions (discarded 736 similar events)
// Phase 1: matrix 1287 rows 783 cols
[2024-05-31 22:43:55] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:43:55] [INFO ] State equation strengthened by 235 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 370/435 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 78/513 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 951/1464 variables, 513/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1464 variables, 50/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1464 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 408/1872 variables, 144/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1872 variables, 183/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1872 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 191/2063 variables, 121/1013 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2063 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2063 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/2069 variables, 4/1019 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2069 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/2070 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2070 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2070 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 1020 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 783/783 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 370/435 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 78/513 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 951/1464 variables, 513/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1464 variables, 50/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1464 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 408/1872 variables, 144/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1872 variables, 183/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1872 variables, 5/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1872 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 191/2063 variables, 121/1018 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2063 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2063 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/2069 variables, 4/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2069 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/2070 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2070 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2070 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 1025 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 783/783 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3527ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 40162 ms.
Support contains 65 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 2023/2023 transitions.
Applied a total of 0 rules in 124 ms. Remains 783 /783 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 783/783 places, 2023/2023 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 2023/2023 transitions.
Applied a total of 0 rules in 120 ms. Remains 783 /783 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
[2024-05-31 22:44:39] [INFO ] Flow matrix only has 1287 transitions (discarded 736 similar events)
[2024-05-31 22:44:39] [INFO ] Invariant cache hit.
[2024-05-31 22:44:39] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-31 22:44:39] [INFO ] Flow matrix only has 1287 transitions (discarded 736 similar events)
[2024-05-31 22:44:39] [INFO ] Invariant cache hit.
[2024-05-31 22:44:39] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-31 22:44:43] [INFO ] Implicit Places using invariants and state equation in 4084 ms returned []
Implicit Place search using SMT with State Equation took 4644 ms to find 0 implicit places.
[2024-05-31 22:44:43] [INFO ] Redundant transitions in 104 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-31 22:44:43] [INFO ] Flow matrix only has 1287 transitions (discarded 736 similar events)
[2024-05-31 22:44:43] [INFO ] Invariant cache hit.
[2024-05-31 22:44:43] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/781 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/2070 variables, and 2 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/783 constraints, ReadFeed: 0/235 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/781 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 3 (OVERLAPS) 1287/2068 variables, 781/783 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2068 variables, 235/1018 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2068/2070 variables, and 1274 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 781/783 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 256/2021 constraints, Known Traps: 0/0 constraints]
After SMT, in 70728ms problems are : Problem set: 0 solved, 2021 unsolved
Search for dead transitions found 0 dead transitions in 70753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75643 ms. Remains : 783/783 places, 2023/2023 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 783 rules applied. Total rules applied 783 place count 783 transition count 1240
Reduce places removed 47 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 834 place count 736 transition count 1236
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 838 place count 732 transition count 1236
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 838 place count 732 transition count 1057
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1196 place count 553 transition count 1057
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1466 place count 418 transition count 922
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1525 place count 359 transition count 804
Iterating global reduction 3 with 59 rules applied. Total rules applied 1584 place count 359 transition count 804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1585 place count 359 transition count 803
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 1640 place count 304 transition count 693
Iterating global reduction 4 with 55 rules applied. Total rules applied 1695 place count 304 transition count 693
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 1746 place count 253 transition count 591
Iterating global reduction 4 with 51 rules applied. Total rules applied 1797 place count 253 transition count 591
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 1843 place count 253 transition count 545
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 5 with 2 rules applied. Total rules applied 1845 place count 252 transition count 544
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1897 place count 226 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1923 place count 226 transition count 523
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1924 place count 225 transition count 522
Iterating global reduction 5 with 1 rules applied. Total rules applied 1925 place count 225 transition count 522
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1927 place count 225 transition count 520
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1940 place count 225 transition count 507
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1956 place count 212 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1957 place count 212 transition count 503
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1960 place count 212 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1961 place count 212 transition count 502
Applied a total of 1961 rules in 237 ms. Remains 212 /783 variables (removed 571) and now considering 502/2023 (removed 1521) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 502 rows 212 cols
[2024-05-31 22:45:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:45:55] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 22:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:45:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 22:45:55] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 22:45:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:45:55] [INFO ] After 85ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 22:45:55] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 22:45:55] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1237 ms.
[2024-05-31 22:45:55] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 17 ms.
[2024-05-31 22:45:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 783 places, 2023 transitions and 8232 arcs took 18 ms.
[2024-05-31 22:45:56] [INFO ] Flatten gal took : 168 ms
Total runtime 186000 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-ReachabilityCardinality-2023-00
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityCardinality-2023-05
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityCardinality-2024-07
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityCardinality-2024-09
Could not compute solution for formula : FunctionPointer-PT-c128-ReachabilityCardinality-2023-10
BK_STOP 1717195556747
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name FunctionPointer-PT-c128-ReachabilityCardinality-2023-00
rfs formula type EF
rfs formula formula --invariant=/tmp/554/inv_0_
rfs formula name FunctionPointer-PT-c128-ReachabilityCardinality-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/554/inv_1_
rfs formula name FunctionPointer-PT-c128-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/554/inv_2_
rfs formula name FunctionPointer-PT-c128-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/554/inv_3_
rfs formula name FunctionPointer-PT-c128-ReachabilityCardinality-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/554/inv_4_
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171640603200326"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;