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-171640601200287.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200287
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716437257208

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:07:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 04:07:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:07:38] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2024-05-23 04:07:38] [INFO ] Transformed 2826 places.
[2024-05-23 04:07:38] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:07:38] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40004 steps (8 resets) in 2855 ms. (14 steps per ms) remains 9/12 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
[2024-05-23 04:07:40] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 04:07:40] [INFO ] Computed 4 invariants in 88 ms
[2024-05-23 04:07:40] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FunctionPointer-PT-c004-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 538/589 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/590 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1607/2197 variables, 590/594 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2197 variables, 399/993 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2197 variables, 0/993 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2037/4234 variables, 536/1529 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4234 variables, 80/1609 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4234 variables, 0/1609 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 630/4864 variables, 424/2033 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4864 variables, 0/2033 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 226/5090 variables, 56/2089 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5090 variables, 0/2089 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 78/5168 variables, 22/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 543/567 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 04:07:45] [INFO ] Deduced a trap composed of 135 places in 226 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/568 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1485/2053 variables, 568/573 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2053 variables, 399/972 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 0/972 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1772/3825 variables, 470/1442 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3825 variables, 80/1522 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3825 variables, 6/1528 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 04:07:47] [INFO ] Deduced a trap composed of 131 places in 257 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3825 variables, 1/1529 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3825 variables, 0/1529 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 710/4535 variables, 436/1965 constraints. Problems are: Problem set: 1 solved, 7 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 Int declared 4535/5168 variables, and 1965 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1474/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 9059ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 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 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 289 places :
Symmetric choice reduction at 0 with 289 rule applications. Total rules 290 place count 1322 transition count 3804
Iterating global reduction 0 with 289 rules applied. Total rules applied 579 place count 1322 transition count 3804
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Iterating post reduction 0 with 426 rules applied. Total rules applied 1005 place count 1322 transition count 3378
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 1152 place count 1175 transition count 3084
Iterating global reduction 1 with 147 rules applied. Total rules applied 1299 place count 1175 transition count 3084
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 1391 place count 1175 transition count 2992
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1405 place count 1161 transition count 2964
Iterating global reduction 2 with 14 rules applied. Total rules applied 1419 place count 1161 transition count 2964
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1433 place count 1147 transition count 2936
Iterating global reduction 2 with 14 rules applied. Total rules applied 1447 place count 1147 transition count 2936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1461 place count 1133 transition count 2908
Iterating global reduction 2 with 14 rules applied. Total rules applied 1475 place count 1133 transition count 2908
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1489 place count 1119 transition count 2880
Iterating global reduction 2 with 14 rules applied. Total rules applied 1503 place count 1119 transition count 2880
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1517 place count 1105 transition count 2852
Iterating global reduction 2 with 14 rules applied. Total rules applied 1531 place count 1105 transition count 2852
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1543 place count 1093 transition count 2828
Iterating global reduction 2 with 12 rules applied. Total rules applied 1555 place count 1093 transition count 2828
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1566 place count 1082 transition count 2806
Iterating global reduction 2 with 11 rules applied. Total rules applied 1577 place count 1082 transition count 2806
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 1616 place count 1043 transition count 2662
Iterating global reduction 2 with 39 rules applied. Total rules applied 1655 place count 1043 transition count 2662
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1703 place count 995 transition count 2470
Iterating global reduction 2 with 48 rules applied. Total rules applied 1751 place count 995 transition count 2470
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1799 place count 947 transition count 2342
Iterating global reduction 2 with 48 rules applied. Total rules applied 1847 place count 947 transition count 2342
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1895 place count 899 transition count 2246
Iterating global reduction 2 with 48 rules applied. Total rules applied 1943 place count 899 transition count 2246
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1991 place count 851 transition count 2150
Iterating global reduction 2 with 48 rules applied. Total rules applied 2039 place count 851 transition count 2150
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2087 place count 803 transition count 2054
Iterating global reduction 2 with 48 rules applied. Total rules applied 2135 place count 803 transition count 2054
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2181 place count 757 transition count 1962
Iterating global reduction 2 with 46 rules applied. Total rules applied 2227 place count 757 transition count 1962
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 2241 place count 743 transition count 1934
Iterating global reduction 2 with 14 rules applied. Total rules applied 2255 place count 743 transition count 1934
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 2287 place count 743 transition count 1902
Applied a total of 2287 rules in 1912 ms. Remains 743 /1628 variables (removed 885) and now considering 1902/5962 (removed 4060) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 743/1628 places, 1902/5962 transitions.
RANDOM walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
[2024-05-23 04:07:51] [INFO ] Flow matrix only has 1284 transitions (discarded 618 similar events)
// Phase 1: matrix 1284 rows 743 cols
[2024-05-23 04:07:51] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:07:51] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 974/1378 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1378 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1378 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 524/1902 variables, 237/874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1902 variables, 83/958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1902 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 123/2025 variables, 100/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2025 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/2027 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2027 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2027 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2027/2027 variables, and 1060 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 743/743 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 974/1378 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1378 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1378 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 524/1902 variables, 237/874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1902 variables, 83/958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1902 variables, 6/964 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 04:07:54] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1902 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1902 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 123/2025 variables, 100/1065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2025 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/2027 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2027 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2027 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2027/2027 variables, and 1067 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 743/743 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5279ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2528 ms.
Support contains 23 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 1902/1902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 742 transition count 1900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 742 transition count 1900
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 741 transition count 1898
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 741 transition count 1898
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 740 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 740 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 739 transition count 1892
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 739 transition count 1892
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 738 transition count 1890
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 738 transition count 1890
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 737 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 737 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 736 transition count 1886
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 736 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 735 transition count 1884
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 735 transition count 1884
Applied a total of 16 rules in 280 ms. Remains 735 /743 variables (removed 8) and now considering 1884/1902 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 735/743 places, 1884/1902 transitions.
RANDOM walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 215115 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 215115 steps, saw 140658 distinct states, run finished after 3012 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-23 04:08:03] [INFO ] Flow matrix only has 1273 transitions (discarded 611 similar events)
// Phase 1: matrix 1273 rows 735 cols
[2024-05-23 04:08:03] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:08:03] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 970/1374 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 515/1889 variables, 232/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1889 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1889 variables, 82/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1889 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 118/2007 variables, 98/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2007 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/2008 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2008 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2008 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2008/2008 variables, and 1051 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 735/735 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 970/1374 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 515/1889 variables, 232/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1889 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1889 variables, 82/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1889 variables, 6/958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 04:08:05] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1889 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1889 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 118/2007 variables, 98/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2007 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/2008 variables, 1/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2008 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2008 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2008/2008 variables, and 1058 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 735/735 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5253ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2246 ms.
Support contains 23 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1884/1884 transitions.
Applied a total of 0 rules in 110 ms. Remains 735 /735 variables (removed 0) and now considering 1884/1884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 735/735 places, 1884/1884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1884/1884 transitions.
Applied a total of 0 rules in 112 ms. Remains 735 /735 variables (removed 0) and now considering 1884/1884 (removed 0) transitions.
[2024-05-23 04:08:10] [INFO ] Flow matrix only has 1273 transitions (discarded 611 similar events)
[2024-05-23 04:08:10] [INFO ] Invariant cache hit.
[2024-05-23 04:08:11] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-23 04:08:11] [INFO ] Flow matrix only has 1273 transitions (discarded 611 similar events)
[2024-05-23 04:08:11] [INFO ] Invariant cache hit.
[2024-05-23 04:08:11] [INFO ] State equation strengthened by 314 read => feed constraints.
[2024-05-23 04:08:14] [INFO ] Implicit Places using invariants and state equation in 2906 ms returned []
Implicit Place search using SMT with State Equation took 3286 ms to find 0 implicit places.
[2024-05-23 04:08:14] [INFO ] Redundant transitions in 101 ms returned []
Running 1882 sub problems to find dead transitions.
[2024-05-23 04:08:14] [INFO ] Flow matrix only has 1273 transitions (discarded 611 similar events)
[2024-05-23 04:08:14] [INFO ] Invariant cache hit.
[2024-05-23 04:08:14] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/2008 variables, and 2 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/735 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 3 (OVERLAPS) 1273/2008 variables, 735/737 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2008 variables, 314/1051 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2008/2008 variables, and 2933 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 31940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 735/735 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
After SMT, in 71035ms problems are : Problem set: 0 solved, 1882 unsolved
Search for dead transitions found 0 dead transitions in 71054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74574 ms. Remains : 735/735 places, 1884/1884 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1109 edges and 735 vertex of which 192 / 735 are part of one of the 64 SCC in 3 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 483 transitions
Reduce isomorphic transitions removed 803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 607 transition count 1065
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 591 transition count 1065
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 33 place count 591 transition count 957
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 249 place count 483 transition count 957
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 312 place count 420 transition count 894
Iterating global reduction 2 with 63 rules applied. Total rules applied 375 place count 420 transition count 894
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 501 place count 420 transition count 768
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 777 place count 282 transition count 630
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 839 place count 220 transition count 506
Iterating global reduction 3 with 62 rules applied. Total rules applied 901 place count 220 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 902 place count 220 transition count 505
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 962 place count 160 transition count 385
Iterating global reduction 4 with 60 rules applied. Total rules applied 1022 place count 160 transition count 385
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1082 place count 100 transition count 265
Iterating global reduction 4 with 60 rules applied. Total rules applied 1142 place count 100 transition count 265
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 1202 place count 100 transition count 205
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 1204 place count 99 transition count 204
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1232 place count 85 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1234 place count 85 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 1255 place count 85 transition count 199
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1256 place count 84 transition count 198
Iterating global reduction 6 with 1 rules applied. Total rules applied 1257 place count 84 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1265 place count 84 transition count 190
Applied a total of 1265 rules in 105 ms. Remains 84 /735 variables (removed 651) and now considering 190/1884 (removed 1694) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 190 rows 84 cols
[2024-05-23 04:09:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 04:09:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:09:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:09:25] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 04:09:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:09:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 04:09:25] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 04:09:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:09:25] [INFO ] After 70ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 04:09:26] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 04:09:26] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 679 ms.
[2024-05-23 04:09:26] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-23 04:09:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 735 places, 1884 transitions and 7662 arcs took 14 ms.
[2024-05-23 04:09:26] [INFO ] Flatten gal took : 155 ms
Total runtime 108166 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/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 735
TRANSITIONS: 1884
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 603
MODEL NAME: /home/mcc/execution/412/model
735 places, 1884 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716437792859

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
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-c004"
export BK_EXAMINATION="ReachabilityFireability"
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 ReachabilityFireability"
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-171640601200287"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;