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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 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:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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-c004-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2023-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2023-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716437183133

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-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:06:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 04:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:06:24] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2024-05-23 04:06:24] [INFO ] Transformed 2826 places.
[2024-05-23 04:06:24] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:06:24] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 39 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40007 steps (8 resets) in 3043 ms. (13 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/6 properties
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 04:06:26] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 04:06:26] [INFO ] Computed 4 invariants in 78 ms
[2024-05-23 04:06:26] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 542/558 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/560 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/561 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1424/1985 variables, 561/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1985 variables, 403/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1985 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem FunctionPointer-PT-c004-ReachabilityCardinality-2023-01 is UNSAT
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-2023-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1320/3305 variables, 414/1382 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3305 variables, 76/1458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3305 variables, 0/1458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 720/4025 variables, 385/1843 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4025 variables, 0/1843 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 704/4729 variables, 149/1992 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4729 variables, 0/1992 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 439/5168 variables, 119/2111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2703 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: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 381/392 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 675/1067 variables, 392/393 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1067 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 818/1885 variables, 36/429 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1885 variables, 1/430 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1885 variables, 324/754 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1885 variables, 4/758 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1885 variables, 0/758 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 160/2045 variables, 2/760 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2045 variables, 2/762 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-23 04:06:31] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 25 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2045 variables, 1/763 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2045 variables, 0/763 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1130/3175 variables, 543/1306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3175 variables, 155/1461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3175 variables, 0/1461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 737/3912 variables, 366/1827 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3912 variables, 0/1827 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 728/4640 variables, 145/1972 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4640 variables, 0/1972 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 528/5168 variables, 144/2116 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5168 variables, 0/2116 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/5168 variables, 0/2116 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2116 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4290 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: 4/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 7273ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 11 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 1431 are kept as prefixes of interest. Removing 197 places using SCC suffix rule.13 ms
Discarding 197 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 0 with 360 rules applied. Total rules applied 361 place count 1431 transition count 5602
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 660 place count 1132 transition count 3324
Iterating global reduction 1 with 299 rules applied. Total rules applied 959 place count 1132 transition count 3324
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 1319 place count 1132 transition count 2964
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1474 place count 977 transition count 2654
Iterating global reduction 2 with 155 rules applied. Total rules applied 1629 place count 977 transition count 2654
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1693 place count 977 transition count 2590
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1707 place count 963 transition count 2562
Iterating global reduction 3 with 14 rules applied. Total rules applied 1721 place count 963 transition count 2562
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1735 place count 949 transition count 2534
Iterating global reduction 3 with 14 rules applied. Total rules applied 1749 place count 949 transition count 2534
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1763 place count 935 transition count 2506
Iterating global reduction 3 with 14 rules applied. Total rules applied 1777 place count 935 transition count 2506
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1791 place count 921 transition count 2478
Iterating global reduction 3 with 14 rules applied. Total rules applied 1805 place count 921 transition count 2478
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1819 place count 907 transition count 2450
Iterating global reduction 3 with 14 rules applied. Total rules applied 1833 place count 907 transition count 2450
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1847 place count 893 transition count 2422
Iterating global reduction 3 with 14 rules applied. Total rules applied 1861 place count 893 transition count 2422
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1874 place count 880 transition count 2396
Iterating global reduction 3 with 13 rules applied. Total rules applied 1887 place count 880 transition count 2396
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1947 place count 820 transition count 2168
Iterating global reduction 3 with 60 rules applied. Total rules applied 2007 place count 820 transition count 2168
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2067 place count 760 transition count 1928
Iterating global reduction 3 with 60 rules applied. Total rules applied 2127 place count 760 transition count 1928
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2187 place count 700 transition count 1796
Iterating global reduction 3 with 60 rules applied. Total rules applied 2247 place count 700 transition count 1796
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2307 place count 640 transition count 1676
Iterating global reduction 3 with 60 rules applied. Total rules applied 2367 place count 640 transition count 1676
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2427 place count 580 transition count 1556
Iterating global reduction 3 with 60 rules applied. Total rules applied 2487 place count 580 transition count 1556
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2547 place count 520 transition count 1436
Iterating global reduction 3 with 60 rules applied. Total rules applied 2607 place count 520 transition count 1436
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2666 place count 461 transition count 1318
Iterating global reduction 3 with 59 rules applied. Total rules applied 2725 place count 461 transition count 1318
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2731 place count 455 transition count 1306
Iterating global reduction 3 with 6 rules applied. Total rules applied 2737 place count 455 transition count 1306
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 2745 place count 455 transition count 1298
Applied a total of 2745 rules in 1248 ms. Remains 455 /1628 variables (removed 1173) and now considering 1298/5962 (removed 4664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 455/1628 places, 1298/5962 transitions.
RANDOM walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 237671 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 237671 steps, saw 149340 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-23 04:06:38] [INFO ] Flow matrix only has 750 transitions (discarded 548 similar events)
// Phase 1: matrix 750 rows 455 cols
[2024-05-23 04:06:38] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:06:38] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 381/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 84/1139 variables, 22/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 88/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 60/1199 variables, 35/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1199 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1199 variables, 7/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1199 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/1205 variables, 6/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1205 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1205 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 552 constraints, problems are : Problem set: 0 solved, 4 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 455/455 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 381/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 663/1055 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 84/1139 variables, 22/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 88/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 60/1199 variables, 35/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1199 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1199 variables, 7/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:06:39] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1199 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1199 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/1205 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1205 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1205 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 557 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 455/455 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1845ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 409 ms.
Support contains 11 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1298/1298 transitions.
Applied a total of 0 rules in 53 ms. Remains 455 /455 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 455/455 places, 1298/1298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1298/1298 transitions.
Applied a total of 0 rules in 49 ms. Remains 455 /455 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
[2024-05-23 04:06:40] [INFO ] Flow matrix only has 750 transitions (discarded 548 similar events)
[2024-05-23 04:06:40] [INFO ] Invariant cache hit.
[2024-05-23 04:06:41] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-23 04:06:41] [INFO ] Flow matrix only has 750 transitions (discarded 548 similar events)
[2024-05-23 04:06:41] [INFO ] Invariant cache hit.
[2024-05-23 04:06:41] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 04:06:42] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2024-05-23 04:06:42] [INFO ] Redundant transitions in 77 ms returned []
Running 1296 sub problems to find dead transitions.
[2024-05-23 04:06:42] [INFO ] Flow matrix only has 750 transitions (discarded 548 similar events)
[2024-05-23 04:06:42] [INFO ] Invariant cache hit.
[2024-05-23 04:06:42] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 750/1205 variables, 455/457 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
SMT process timed out in 34607ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 34623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36673 ms. Remains : 455/455 places, 1298/1298 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 548 transitions
Reduce isomorphic transitions removed 548 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 455 transition count 742
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 568 place count 447 transition count 738
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 572 place count 443 transition count 738
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 572 place count 443 transition count 663
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 722 place count 368 transition count 663
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 984 place count 237 transition count 532
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1046 place count 175 transition count 408
Iterating global reduction 3 with 62 rules applied. Total rules applied 1108 place count 175 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1111 place count 175 transition count 405
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 1172 place count 114 transition count 283
Iterating global reduction 4 with 61 rules applied. Total rules applied 1233 place count 114 transition count 283
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1293 place count 54 transition count 163
Iterating global reduction 4 with 60 rules applied. Total rules applied 1353 place count 54 transition count 163
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 1412 place count 54 transition count 104
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 1414 place count 53 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1420 place count 50 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1429 place count 50 transition count 100
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1430 place count 49 transition count 99
Iterating global reduction 5 with 1 rules applied. Total rules applied 1431 place count 49 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1433 place count 49 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1434 place count 49 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1435 place count 48 transition count 96
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 1436 place count 48 transition count 95
Applied a total of 1436 rules in 56 ms. Remains 48 /455 variables (removed 407) and now considering 95/1298 (removed 1203) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 95 rows 48 cols
[2024-05-23 04:07:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:07:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:07:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-23 04:07:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:07:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:07:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:07:17] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 04:07:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:07:17] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 04:07:17] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 04:07:17] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 239 ms.
[2024-05-23 04:07:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-23 04:07:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 455 places, 1298 transitions and 5318 arcs took 9 ms.
[2024-05-23 04:07:17] [INFO ] Flatten gal took : 116 ms
Total runtime 53535 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 455
TRANSITIONS: 1298
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.008s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 576
MODEL NAME: /home/mcc/execution/403/model
455 places, 1298 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716437246141

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-c004"
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-c004, 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-171640601200286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;