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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 16:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 16:03 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:26 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 34K 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-a128-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2023-08
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-a128-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716431319203

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-a128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:28:40] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 02:28:40] [INFO ] Transformed 40 places.
[2024-05-23 02:28:40] [INFO ] Transformed 70 transitions.
[2024-05-23 02:28:40] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40090 steps (76 resets) in 1015 ms. (39 steps per ms) remains 12/14 properties
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (90 resets) in 300 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (66 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (78 resets) in 313 ms. (127 steps per ms) remains 11/12 properties
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 229 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (71 resets) in 594 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (82 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (60 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (223 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (58 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
[2024-05-23 02:28:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:28:41] [INFO ] Computed 4 invariants in 8 ms
[2024-05-23 02:28:41] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem FunctionPointer-PT-a128-ReachabilityCardinality-2024-09 is UNSAT
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-a128-ReachabilityCardinality-2024-12 is UNSAT
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem FunctionPointer-PT-a128-ReachabilityCardinality-2024-11 is UNSAT
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/32 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 46/78 variables, 32/36 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 8/44 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/80 variables, 2/46 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 3 solved, 8 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3/31 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-23 02:28:42] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 46/78 variables, 32/37 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 8/45 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 5/50 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/80 variables, 2/52 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 3/55 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 55 constraints, problems are : Problem set: 3 solved, 8 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 872ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2023-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2023-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-a128-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 16385 ms.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 28 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 28 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 27 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 27 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 27 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 27 transition count 54
Applied a total of 13 rules in 25 ms. Remains 27 /34 variables (removed 7) and now considering 54/66 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 27/34 places, 54/66 transitions.
RANDOM walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 723672 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 723672 steps, saw 453963 distinct states, run finished after 3004 ms. (steps per millisecond=240 ) properties seen :0
[2024-05-23 02:29:02] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2024-05-23 02:29:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:29:02] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/44 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/65 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/66 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/44 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/65 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/66 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-23 02:29:02] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:29:02] [INFO ] Invariant cache hit.
[2024-05-23 02:29:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 02:29:02] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:29:02] [INFO ] Invariant cache hit.
[2024-05-23 02:29:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:29:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-23 02:29:02] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-23 02:29:02] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:29:02] [INFO ] Invariant cache hit.
[2024-05-23 02:29:02] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 37 constraints, problems are : Problem set: 0 solved, 52 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 52/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 27/27 places, 54/54 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 27 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 26 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 26 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 24 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 22 transition count 34
Applied a total of 25 rules in 10 ms. Remains 22 /27 variables (removed 5) and now considering 34/54 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 22 cols
[2024-05-23 02:29:03] [INFO ] Computed 3 invariants in 4 ms
[2024-05-23 02:29:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:29:03] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:29:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:29:03] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 02:29:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:29:03] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 02:29:03] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 02:29:03] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 146 ms.
[2024-05-23 02:29:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-23 02:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 54 transitions and 216 arcs took 3 ms.
[2024-05-23 02:29:03] [INFO ] Flatten gal took : 24 ms
Total runtime 23386 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-a128

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 568
MODEL NAME: /home/mcc/execution/411/model
27 places, 54 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...
Start RS construction.
Building monolithic NSF...
coverability test failed!!
Convergence in 9 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431344419

--------------------
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

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

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