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-171640601200310.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-c032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716445116211

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-c032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 06:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 06:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 06:18:37] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2024-05-23 06:18:37] [INFO ] Transformed 2826 places.
[2024-05-23 06:18:37] [INFO ] Transformed 8960 transitions.
[2024-05-23 06:18:37] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40071 steps (8 resets) in 2289 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 245 ms. (162 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 486 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (16 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (15 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 103007 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 10
Probabilistic random walk after 103007 steps, saw 84089 distinct states, run finished after 3006 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-23 06:18:42] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 06:18:42] [INFO ] Computed 4 invariants in 72 ms
[2024-05-23 06:18:42] [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, 10 unsolved
Problem FunctionPointer-PT-c032-ReachabilityCardinality-2024-06 is UNSAT
FORMULA FunctionPointer-PT-c032-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 525/597 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/598 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1562/2160 variables, 598/602 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2160 variables, 404/1006 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2160 variables, 0/1006 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1742/3902 variables, 502/1508 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3902 variables, 75/1583 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3902 variables, 0/1583 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 819/4721 variables, 399/1982 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4721 variables, 0/1982 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 289/5010 variables, 83/2065 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5010 variables, 0/2065 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 158/5168 variables, 46/2111 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4157 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: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 526/597 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-23 06:18:46] [INFO ] Deduced a trap composed of 135 places in 215 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/598 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1562/2160 variables, 598/603 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2160 variables, 404/1007 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2160 variables, 0/1007 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1742/3902 variables, 502/1509 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3902 variables, 75/1584 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3902 variables, 9/1593 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3902 variables, 0/1593 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 819/4721 variables, 399/1992 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4721 variables, 0/1992 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 289/5010 variables, 83/2075 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5010 variables, 0/2075 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 158/5168 variables, 46/2121 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2121 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 9402ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 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 1441 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.11 ms
Discarding 187 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Iterating post reduction 0 with 345 rules applied. Total rules applied 346 place count 1441 transition count 5617
Discarding 278 places :
Symmetric choice reduction at 1 with 278 rule applications. Total rules 624 place count 1163 transition count 3441
Iterating global reduction 1 with 278 rules applied. Total rules applied 902 place count 1163 transition count 3441
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 1 with 364 rules applied. Total rules applied 1266 place count 1163 transition count 3077
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 1410 place count 1019 transition count 2789
Iterating global reduction 2 with 144 rules applied. Total rules applied 1554 place count 1019 transition count 2789
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 1634 place count 1019 transition count 2709
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1646 place count 1007 transition count 2685
Iterating global reduction 3 with 12 rules applied. Total rules applied 1658 place count 1007 transition count 2685
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1670 place count 995 transition count 2661
Iterating global reduction 3 with 12 rules applied. Total rules applied 1682 place count 995 transition count 2661
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1694 place count 983 transition count 2637
Iterating global reduction 3 with 12 rules applied. Total rules applied 1706 place count 983 transition count 2637
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1717 place count 972 transition count 2615
Iterating global reduction 3 with 11 rules applied. Total rules applied 1728 place count 972 transition count 2615
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1739 place count 961 transition count 2593
Iterating global reduction 3 with 11 rules applied. Total rules applied 1750 place count 961 transition count 2593
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1758 place count 953 transition count 2577
Iterating global reduction 3 with 8 rules applied. Total rules applied 1766 place count 953 transition count 2577
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1772 place count 947 transition count 2565
Iterating global reduction 3 with 6 rules applied. Total rules applied 1778 place count 947 transition count 2565
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1802 place count 923 transition count 2475
Iterating global reduction 3 with 24 rules applied. Total rules applied 1826 place count 923 transition count 2475
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1858 place count 891 transition count 2347
Iterating global reduction 3 with 32 rules applied. Total rules applied 1890 place count 891 transition count 2347
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1922 place count 859 transition count 2259
Iterating global reduction 3 with 32 rules applied. Total rules applied 1954 place count 859 transition count 2259
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1986 place count 827 transition count 2195
Iterating global reduction 3 with 32 rules applied. Total rules applied 2018 place count 827 transition count 2195
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 2047 place count 798 transition count 2137
Iterating global reduction 3 with 29 rules applied. Total rules applied 2076 place count 798 transition count 2137
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 2104 place count 770 transition count 2081
Iterating global reduction 3 with 28 rules applied. Total rules applied 2132 place count 770 transition count 2081
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2156 place count 746 transition count 2033
Iterating global reduction 3 with 24 rules applied. Total rules applied 2180 place count 746 transition count 2033
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2188 place count 738 transition count 2017
Iterating global reduction 3 with 8 rules applied. Total rules applied 2196 place count 738 transition count 2017
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 2260 place count 738 transition count 1953
Applied a total of 2260 rules in 1295 ms. Remains 738 /1628 variables (removed 890) and now considering 1953/5962 (removed 4009) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1303 ms. Remains : 738/1628 places, 1953/5962 transitions.
RANDOM walk for 40023 steps (8 resets) in 260 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 170780 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 9
Probabilistic random walk after 170780 steps, saw 105217 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-23 06:18:56] [INFO ] Flow matrix only has 1223 transitions (discarded 730 similar events)
// Phase 1: matrix 1223 rows 738 cols
[2024-05-23 06:18:56] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 06:18:56] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 367/438 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 68/506 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 931/1437 variables, 506/508 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1437 variables, 51/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1437 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 342/1779 variables, 127/686 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1779 variables, 156/842 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1779 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 173/1952 variables, 100/942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1952 variables, 3/945 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1952 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 4/1956 variables, 2/947 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1956 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 4/1960 variables, 2/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/1961 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1961 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/1961 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 950 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 738/738 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 367/438 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 68/506 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 931/1437 variables, 506/508 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1437 variables, 51/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1437 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 342/1779 variables, 127/686 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1779 variables, 156/842 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1779 variables, 9/851 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1779 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 173/1952 variables, 100/951 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1952 variables, 3/954 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1952 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/1956 variables, 2/956 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1956 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 4/1960 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 1/1961 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1961 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1961 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/1961 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 960 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 738/738 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 6299ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 71 out of 738 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 738/738 places, 1953/1953 transitions.
Applied a total of 0 rules in 96 ms. Remains 738 /738 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 738/738 places, 1953/1953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 738/738 places, 1953/1953 transitions.
Applied a total of 0 rules in 170 ms. Remains 738 /738 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
[2024-05-23 06:19:02] [INFO ] Flow matrix only has 1223 transitions (discarded 730 similar events)
[2024-05-23 06:19:02] [INFO ] Invariant cache hit.
[2024-05-23 06:19:03] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-23 06:19:03] [INFO ] Flow matrix only has 1223 transitions (discarded 730 similar events)
[2024-05-23 06:19:03] [INFO ] Invariant cache hit.
[2024-05-23 06:19:03] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-23 06:19:05] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2024-05-23 06:19:05] [INFO ] Redundant transitions in 107 ms returned []
Running 1951 sub problems to find dead transitions.
[2024-05-23 06:19:05] [INFO ] Flow matrix only has 1223 transitions (discarded 730 similar events)
[2024-05-23 06:19:05] [INFO ] Invariant cache hit.
[2024-05-23 06:19:05] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/737 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/1961 variables, and 2 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/738 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/737 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/737 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
At refinement iteration 3 (OVERLAPS) 1223/1960 variables, 737/739 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1960 variables, 210/949 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1961 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 737/738 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 256/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 68737ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 68756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71625 ms. Remains : 738/738 places, 1953/1953 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 763 rules applied. Total rules applied 763 place count 738 transition count 1190
Reduce places removed 33 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 40 rules applied. Total rules applied 803 place count 705 transition count 1183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 810 place count 698 transition count 1183
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 810 place count 698 transition count 1026
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 1124 place count 541 transition count 1026
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 1388 place count 409 transition count 894
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1445 place count 352 transition count 780
Iterating global reduction 3 with 57 rules applied. Total rules applied 1502 place count 352 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1503 place count 352 transition count 779
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 1556 place count 299 transition count 673
Iterating global reduction 4 with 53 rules applied. Total rules applied 1609 place count 299 transition count 673
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 1661 place count 247 transition count 569
Iterating global reduction 4 with 52 rules applied. Total rules applied 1713 place count 247 transition count 569
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 1755 place count 247 transition count 527
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 1757 place count 246 transition count 526
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1807 place count 221 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 5 with 47 rules applied. Total rules applied 1854 place count 221 transition count 493
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1855 place count 220 transition count 492
Iterating global reduction 5 with 1 rules applied. Total rules applied 1856 place count 220 transition count 492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1857 place count 220 transition count 491
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1861 place count 220 transition count 487
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1865 place count 216 transition count 487
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 1866 place count 216 transition count 486
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 1869 place count 216 transition count 486
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 1870 place count 216 transition count 485
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1872 place count 216 transition count 485
Applied a total of 1872 rules in 211 ms. Remains 216 /738 variables (removed 522) and now considering 485/1953 (removed 1468) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 485 rows 216 cols
[2024-05-23 06:20:14] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 06:20:14] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 06:20:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 06:20:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:20:14] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 06:20:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:20:15] [INFO ] After 163ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 06:20:15] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-23 06:20:15] [INFO ] After 905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 1216 ms.
[2024-05-23 06:20:15] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-23 06:20:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 738 places, 1953 transitions and 7942 arcs took 12 ms.
[2024-05-23 06:20:15] [INFO ] Flatten gal took : 161 ms
Total runtime 98576 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c032

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 738
TRANSITIONS: 1953
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.002s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 590
MODEL NAME: /home/mcc/execution/412/model
738 places, 1953 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 1716445749841

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-c032"
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-c032, 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-171640601200310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 execution
cd execution
if [ "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 ;