Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601200302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-c016, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2023-07
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716442169236

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 05:29:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 05:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:29:30] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2024-05-23 05:29:30] [INFO ] Transformed 2826 places.
[2024-05-23 05:29:30] [INFO ] Transformed 8960 transitions.
[2024-05-23 05:29:30] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40003 steps (8 resets) in 3228 ms. (12 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 120 ms. (330 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 376 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 180 ms. (221 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
[2024-05-23 05:29:32] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 05:29:32] [INFO ] Computed 4 invariants in 77 ms
[2024-05-23 05:29:32] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 522/594 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/596 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/597 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1551/2148 variables, 597/601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2148 variables, 407/1008 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2148 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1774/3922 variables, 491/1499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3922 variables, 72/1571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3922 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 812/4734 variables, 415/1986 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4734 variables, 0/1986 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 348/5082 variables, 95/2081 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5082 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 86/5168 variables, 30/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 4323 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 522/594 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/596 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/597 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1551/2148 variables, 597/601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2148 variables, 407/1008 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2148 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 05:29:38] [INFO ] Deduced a trap composed of 135 places in 219 ms of which 28 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2148 variables, 1/1010 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2148 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1774/3922 variables, 491/1501 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3922 variables, 72/1573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3922 variables, 7/1580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3922 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 812/4734 variables, 415/1995 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4734 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 348/5082 variables, 95/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5082 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 86/5168 variables, 30/2120 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 2120 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5018 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: 1/1 constraints]
After SMT, in 9709ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 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 1440 are kept as prefixes of interest. Removing 188 places using SCC suffix rule.15 ms
Discarding 188 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Iterating post reduction 0 with 351 rules applied. Total rules applied 352 place count 1440 transition count 5611
Discarding 277 places :
Symmetric choice reduction at 1 with 277 rule applications. Total rules 629 place count 1163 transition count 3457
Iterating global reduction 1 with 277 rules applied. Total rules applied 906 place count 1163 transition count 3457
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 1 with 384 rules applied. Total rules applied 1290 place count 1163 transition count 3073
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 1429 place count 1024 transition count 2795
Iterating global reduction 2 with 139 rules applied. Total rules applied 1568 place count 1024 transition count 2795
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1640 place count 1024 transition count 2723
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1650 place count 1014 transition count 2703
Iterating global reduction 3 with 10 rules applied. Total rules applied 1660 place count 1014 transition count 2703
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1668 place count 1006 transition count 2687
Iterating global reduction 3 with 8 rules applied. Total rules applied 1676 place count 1006 transition count 2687
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1684 place count 998 transition count 2671
Iterating global reduction 3 with 8 rules applied. Total rules applied 1692 place count 998 transition count 2671
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1699 place count 991 transition count 2657
Iterating global reduction 3 with 7 rules applied. Total rules applied 1706 place count 991 transition count 2657
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1712 place count 985 transition count 2645
Iterating global reduction 3 with 6 rules applied. Total rules applied 1718 place count 985 transition count 2645
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1723 place count 980 transition count 2635
Iterating global reduction 3 with 5 rules applied. Total rules applied 1728 place count 980 transition count 2635
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1731 place count 977 transition count 2629
Iterating global reduction 3 with 3 rules applied. Total rules applied 1734 place count 977 transition count 2629
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1752 place count 959 transition count 2557
Iterating global reduction 3 with 18 rules applied. Total rules applied 1770 place count 959 transition count 2557
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1787 place count 942 transition count 2489
Iterating global reduction 3 with 17 rules applied. Total rules applied 1804 place count 942 transition count 2489
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1818 place count 928 transition count 2461
Iterating global reduction 3 with 14 rules applied. Total rules applied 1832 place count 928 transition count 2461
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1845 place count 915 transition count 2435
Iterating global reduction 3 with 13 rules applied. Total rules applied 1858 place count 915 transition count 2435
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1871 place count 902 transition count 2409
Iterating global reduction 3 with 13 rules applied. Total rules applied 1884 place count 902 transition count 2409
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1897 place count 889 transition count 2383
Iterating global reduction 3 with 13 rules applied. Total rules applied 1910 place count 889 transition count 2383
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1917 place count 882 transition count 2369
Iterating global reduction 3 with 7 rules applied. Total rules applied 1924 place count 882 transition count 2369
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 3 with 94 rules applied. Total rules applied 2018 place count 882 transition count 2275
Applied a total of 2018 rules in 1456 ms. Remains 882 /1628 variables (removed 746) and now considering 2275/5962 (removed 3687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1466 ms. Remains : 882/1628 places, 2275/5962 transitions.
RANDOM walk for 40001 steps (8 resets) in 630 ms. (63 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
[2024-05-23 05:29:44] [INFO ] Flow matrix only has 1453 transitions (discarded 822 similar events)
// Phase 1: matrix 1453 rows 882 cols
[2024-05-23 05:29:44] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 05:29:44] [INFO ] State equation strengthened by 261 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 368/431 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 105/536 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1011/1547 variables, 536/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1547 variables, 65/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1547 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 475/2022 variables, 167/770 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2022 variables, 193/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2022 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 292/2314 variables, 163/1126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2314 variables, 2/1128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2314 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 18/2332 variables, 14/1142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2332 variables, 1/1143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2332 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/2335 variables, 2/1145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2335 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/2335 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2335/2335 variables, and 1145 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 882/882 constraints, ReadFeed: 261/261 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 368/431 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 105/536 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1011/1547 variables, 536/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1547 variables, 65/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1547 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 475/2022 variables, 167/770 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2022 variables, 193/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2022 variables, 7/970 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2022 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 292/2314 variables, 163/1133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2314 variables, 2/1135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2314 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 18/2332 variables, 14/1149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2332 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2332 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 3/2335 variables, 2/1152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2335 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/2335 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2335/2335 variables, and 1152 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 882/882 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 5378ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-2023-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3979 ms.
Support contains 52 out of 882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 882/882 places, 2275/2275 transitions.
Graph (complete) has 3767 edges and 882 vertex of which 875 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 875 transition count 2265
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 866 transition count 2243
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 866 transition count 2243
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 45 place count 866 transition count 2227
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 860 transition count 2213
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 860 transition count 2213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 65 place count 860 transition count 2205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 858 transition count 2201
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 858 transition count 2201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 856 transition count 2197
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 856 transition count 2197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 854 transition count 2193
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 854 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 853 transition count 2191
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 853 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 852 transition count 2189
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 852 transition count 2189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 851 transition count 2187
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 851 transition count 2187
Applied a total of 83 rules in 357 ms. Remains 851 /882 variables (removed 31) and now considering 2187/2275 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 851/882 places, 2187/2275 transitions.
RANDOM walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 180058 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 6
Probabilistic random walk after 180058 steps, saw 110932 distinct states, run finished after 3010 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 05:29:57] [INFO ] Flow matrix only has 1390 transitions (discarded 797 similar events)
// Phase 1: matrix 1390 rows 851 cols
[2024-05-23 05:29:57] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 05:29:57] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 372/424 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 101/525 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 978/1503 variables, 525/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1503 variables, 59/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1503 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 433/1936 variables, 152/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1936 variables, 182/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1936 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 283/2219 variables, 157/1077 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 2/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 17/2236 variables, 14/1093 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2236 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 4/2240 variables, 2/1095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2240 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/2241 variables, 1/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2241 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/2241 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2241/2241 variables, and 1096 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 243/243 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 372/424 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 101/525 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 978/1503 variables, 525/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1503 variables, 59/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1503 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 433/1936 variables, 152/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1936 variables, 182/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1936 variables, 6/926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1936 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 283/2219 variables, 157/1083 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 2/1085 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 17/2236 variables, 14/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2236 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/2240 variables, 2/1101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2240 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/2241 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2241 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/2241 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2241/2241 variables, and 1102 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 4654ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 52 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 2187/2187 transitions.
Applied a total of 0 rules in 151 ms. Remains 851 /851 variables (removed 0) and now considering 2187/2187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 851/851 places, 2187/2187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 2187/2187 transitions.
Applied a total of 0 rules in 135 ms. Remains 851 /851 variables (removed 0) and now considering 2187/2187 (removed 0) transitions.
[2024-05-23 05:30:02] [INFO ] Flow matrix only has 1390 transitions (discarded 797 similar events)
[2024-05-23 05:30:02] [INFO ] Invariant cache hit.
[2024-05-23 05:30:02] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-23 05:30:02] [INFO ] Flow matrix only has 1390 transitions (discarded 797 similar events)
[2024-05-23 05:30:02] [INFO ] Invariant cache hit.
[2024-05-23 05:30:03] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-05-23 05:30:05] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 3353 ms to find 0 implicit places.
[2024-05-23 05:30:05] [INFO ] Redundant transitions in 123 ms returned []
Running 2185 sub problems to find dead transitions.
[2024-05-23 05:30:05] [INFO ] Flow matrix only has 1390 transitions (discarded 797 similar events)
[2024-05-23 05:30:05] [INFO ] Invariant cache hit.
[2024-05-23 05:30:05] [INFO ] State equation strengthened by 243 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/849 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/849 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 849/2241 variables, and 2 constraints, problems are : Problem set: 0 solved, 2185 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/851 constraints, ReadFeed: 0/243 constraints, PredecessorRefiner: 2185/2185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/849 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/849 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/2241 variables, and 2 constraints, problems are : Problem set: 0 solved, 2185 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/851 constraints, ReadFeed: 0/243 constraints, PredecessorRefiner: 0/2185 constraints, Known Traps: 0/0 constraints]
After SMT, in 70721ms problems are : Problem set: 0 solved, 2185 unsolved
Search for dead transitions found 0 dead transitions in 70748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74387 ms. Remains : 851/851 places, 2187/2187 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 861 rules applied. Total rules applied 861 place count 851 transition count 1326
Reduce places removed 64 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 929 place count 787 transition count 1322
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 933 place count 783 transition count 1322
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 933 place count 783 transition count 1117
Deduced a syphon composed of 205 places in 1 ms
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 3 with 410 rules applied. Total rules applied 1343 place count 578 transition count 1117
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 1629 place count 435 transition count 974
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1688 place count 376 transition count 856
Iterating global reduction 3 with 59 rules applied. Total rules applied 1747 place count 376 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1748 place count 376 transition count 855
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 1803 place count 321 transition count 745
Iterating global reduction 4 with 55 rules applied. Total rules applied 1858 place count 321 transition count 745
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 1911 place count 268 transition count 639
Iterating global reduction 4 with 53 rules applied. Total rules applied 1964 place count 268 transition count 639
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 2014 place count 268 transition count 589
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 2016 place count 267 transition count 588
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 2102 place count 224 transition count 631
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2104 place count 224 transition count 629
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 2149 place count 224 transition count 584
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2151 place count 222 transition count 582
Iterating global reduction 6 with 2 rules applied. Total rules applied 2153 place count 222 transition count 582
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2172 place count 222 transition count 563
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2175 place count 222 transition count 560
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2178 place count 219 transition count 560
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2179 place count 219 transition count 559
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2183 place count 219 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2184 place count 219 transition count 558
Applied a total of 2184 rules in 197 ms. Remains 219 /851 variables (removed 632) and now considering 558/2187 (removed 1629) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 558 rows 219 cols
[2024-05-23 05:31:16] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 05:31:16] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 05:31:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:31:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:31:16] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 05:31:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:31:16] [INFO ] After 108ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 05:31:17] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 05:31:17] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 970 ms.
[2024-05-23 05:31:17] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-23 05:31:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 851 places, 2187 transitions and 8874 arcs took 15 ms.
[2024-05-23 05:31:17] [INFO ] Flatten gal took : 195 ms
Total runtime 107335 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c016

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 851
TRANSITIONS: 2187
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.046s, Sys 0.001s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 593
MODEL NAME: /home/mcc/execution/410/model
851 places, 2187 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716443121791

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c016, examination is 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 r179-tall-171640601200302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;