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.r069-tall-171620503700046.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 CANConstruction-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716369891188

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:24:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 09:24:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:24:52] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-22 09:24:52] [INFO ] Transformed 5602 places.
[2024-05-22 09:24:52] [INFO ] Transformed 10400 transitions.
[2024-05-22 09:24:52] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (44 resets) in 3018 ms. (13 steps per ms) remains 9/16 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 963 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
// Phase 1: matrix 10400 rows 5602 cols
[2024-05-22 09:24:54] [INFO ] Computed 101 invariants in 133 ms
[2024-05-22 09:24:54] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5372/5552 variables, 50/50 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5552 variables, 2/52 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/5553 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5553 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 48/5601 variables, 48/101 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 10400/16001 variables, 5601/5702 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SMT process timed out in 5460ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 5602 transition count 10072
Reduce places removed 328 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 335 rules applied. Total rules applied 663 place count 5274 transition count 10065
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 670 place count 5267 transition count 10065
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 670 place count 5267 transition count 10060
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 680 place count 5262 transition count 10060
Discarding 2361 places :
Symmetric choice reduction at 3 with 2361 rule applications. Total rules 3041 place count 2901 transition count 5338
Iterating global reduction 3 with 2361 rules applied. Total rules applied 5402 place count 2901 transition count 5338
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 5490 place count 2857 transition count 5294
Free-agglomeration rule applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 5527 place count 2857 transition count 5257
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 5564 place count 2820 transition count 5257
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 5569 place count 2820 transition count 5252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 5574 place count 2815 transition count 5252
Partial Free-agglomeration rule applied 63 times.
Drop transitions (Partial Free agglomeration) removed 63 transitions
Iterating global reduction 5 with 63 rules applied. Total rules applied 5637 place count 2815 transition count 5252
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5638 place count 2815 transition count 5252
Applied a total of 5638 rules in 2887 ms. Remains 2815 /5602 variables (removed 2787) and now considering 5252/10400 (removed 5148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2900 ms. Remains : 2815/5602 places, 5252/10400 transitions.
RANDOM walk for 40000 steps (108 resets) in 819 ms. (48 steps per ms) remains 3/6 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
// Phase 1: matrix 5252 rows 2815 cols
[2024-05-22 09:25:03] [INFO ] Computed 101 invariants in 33 ms
[2024-05-22 09:25:03] [INFO ] State equation strengthened by 5024 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2758 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2758 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2758 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/2766 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2766 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 48/2814 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2814 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5252/8066 variables, 2814/2915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8066 variables, 5024/7939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8066 variables, 0/7939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/8067 variables, 1/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8067 variables, 0/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/8067 variables, 0/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8067/8067 variables, and 7940 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3965 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2815/2815 constraints, ReadFeed: 5024/5024 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2758 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2758 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:25:10] [INFO ] Deduced a trap composed of 2 places in 2340 ms of which 126 ms to minimize.
[2024-05-22 09:25:12] [INFO ] Deduced a trap composed of 53 places in 1634 ms of which 16 ms to minimize.
[2024-05-22 09:25:13] [INFO ] Deduced a trap composed of 61 places in 1510 ms of which 15 ms to minimize.
[2024-05-22 09:25:15] [INFO ] Deduced a trap composed of 53 places in 1504 ms of which 14 ms to minimize.
[2024-05-22 09:25:17] [INFO ] Deduced a trap composed of 55 places in 1735 ms of which 15 ms to minimize.
[2024-05-22 09:25:18] [INFO ] Deduced a trap composed of 53 places in 1588 ms of which 14 ms to minimize.
[2024-05-22 09:25:20] [INFO ] Deduced a trap composed of 61 places in 1551 ms of which 15 ms to minimize.
[2024-05-22 09:25:21] [INFO ] Deduced a trap composed of 53 places in 1460 ms of which 14 ms to minimize.
[2024-05-22 09:25:23] [INFO ] Deduced a trap composed of 55 places in 1300 ms of which 13 ms to minimize.
[2024-05-22 09:25:24] [INFO ] Deduced a trap composed of 57 places in 1396 ms of which 13 ms to minimize.
[2024-05-22 09:25:26] [INFO ] Deduced a trap composed of 53 places in 1483 ms of which 14 ms to minimize.
[2024-05-22 09:25:27] [INFO ] Deduced a trap composed of 53 places in 1402 ms of which 14 ms to minimize.
[2024-05-22 09:25:29] [INFO ] Deduced a trap composed of 53 places in 1483 ms of which 13 ms to minimize.
[2024-05-22 09:25:30] [INFO ] Deduced a trap composed of 53 places in 1296 ms of which 13 ms to minimize.
[2024-05-22 09:25:31] [INFO ] Deduced a trap composed of 53 places in 1273 ms of which 12 ms to minimize.
[2024-05-22 09:25:33] [INFO ] Deduced a trap composed of 56 places in 1274 ms of which 13 ms to minimize.
[2024-05-22 09:25:34] [INFO ] Deduced a trap composed of 53 places in 1356 ms of which 12 ms to minimize.
[2024-05-22 09:25:35] [INFO ] Deduced a trap composed of 59 places in 1402 ms of which 13 ms to minimize.
[2024-05-22 09:25:37] [INFO ] Deduced a trap composed of 55 places in 1429 ms of which 13 ms to minimize.
[2024-05-22 09:25:38] [INFO ] Deduced a trap composed of 55 places in 1331 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2758 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:25:40] [INFO ] Deduced a trap composed of 53 places in 1435 ms of which 12 ms to minimize.
[2024-05-22 09:25:41] [INFO ] Deduced a trap composed of 56 places in 1308 ms of which 13 ms to minimize.
[2024-05-22 09:25:42] [INFO ] Deduced a trap composed of 56 places in 1339 ms of which 13 ms to minimize.
[2024-05-22 09:25:44] [INFO ] Deduced a trap composed of 53 places in 1329 ms of which 13 ms to minimize.
[2024-05-22 09:25:45] [INFO ] Deduced a trap composed of 53 places in 1355 ms of which 14 ms to minimize.
[2024-05-22 09:25:47] [INFO ] Deduced a trap composed of 57 places in 1489 ms of which 13 ms to minimize.
[2024-05-22 09:25:48] [INFO ] Deduced a trap composed of 57 places in 1331 ms of which 12 ms to minimize.
[2024-05-22 09:25:49] [INFO ] Deduced a trap composed of 62 places in 1215 ms of which 12 ms to minimize.
[2024-05-22 09:25:51] [INFO ] Deduced a trap composed of 53 places in 1329 ms of which 12 ms to minimize.
[2024-05-22 09:25:52] [INFO ] Deduced a trap composed of 53 places in 1255 ms of which 13 ms to minimize.
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 2758/8067 variables, and 75 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 43/51 constraints, Generalized P Invariants (flows): 2/50 constraints, State Equation: 0/2815 constraints, ReadFeed: 0/5024 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 49123ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 5252/5252 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2812 transition count 5249
Applied a total of 6 rules in 414 ms. Remains 2812 /2815 variables (removed 3) and now considering 5249/5252 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 2812/2815 places, 5249/5252 transitions.
RANDOM walk for 40000 steps (107 resets) in 1192 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 81959 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 3
Probabilistic random walk after 81959 steps, saw 41421 distinct states, run finished after 3016 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 5249 rows 2812 cols
[2024-05-22 09:25:56] [INFO ] Computed 101 invariants in 29 ms
[2024-05-22 09:25:56] [INFO ] State equation strengthened by 5027 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2662/2755 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2755 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2755 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/2763 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2763 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 48/2811 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2811 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5249/8060 variables, 2811/2912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8060 variables, 5027/7939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8060 variables, 0/7939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/8061 variables, 1/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8061 variables, 0/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/8061 variables, 0/7940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8061/8061 variables, and 7940 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2812/2812 constraints, ReadFeed: 5027/5027 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2662/2755 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2755 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:26:03] [INFO ] Deduced a trap composed of 2 places in 2272 ms of which 20 ms to minimize.
[2024-05-22 09:26:05] [INFO ] Deduced a trap composed of 2 places in 2101 ms of which 15 ms to minimize.
[2024-05-22 09:26:07] [INFO ] Deduced a trap composed of 2 places in 2215 ms of which 17 ms to minimize.
[2024-05-22 09:26:10] [INFO ] Deduced a trap composed of 2 places in 2175 ms of which 30 ms to minimize.
[2024-05-22 09:26:11] [INFO ] Deduced a trap composed of 53 places in 1556 ms of which 20 ms to minimize.
[2024-05-22 09:26:13] [INFO ] Deduced a trap composed of 55 places in 1477 ms of which 15 ms to minimize.
[2024-05-22 09:26:14] [INFO ] Deduced a trap composed of 53 places in 1492 ms of which 13 ms to minimize.
[2024-05-22 09:26:16] [INFO ] Deduced a trap composed of 53 places in 1485 ms of which 14 ms to minimize.
[2024-05-22 09:26:17] [INFO ] Deduced a trap composed of 62 places in 1461 ms of which 14 ms to minimize.
[2024-05-22 09:26:19] [INFO ] Deduced a trap composed of 53 places in 1306 ms of which 13 ms to minimize.
[2024-05-22 09:26:20] [INFO ] Deduced a trap composed of 53 places in 1262 ms of which 12 ms to minimize.
[2024-05-22 09:26:21] [INFO ] Deduced a trap composed of 53 places in 1271 ms of which 12 ms to minimize.
[2024-05-22 09:26:23] [INFO ] Deduced a trap composed of 56 places in 1364 ms of which 13 ms to minimize.
[2024-05-22 09:26:24] [INFO ] Deduced a trap composed of 64 places in 1173 ms of which 12 ms to minimize.
[2024-05-22 09:26:25] [INFO ] Deduced a trap composed of 57 places in 1251 ms of which 13 ms to minimize.
[2024-05-22 09:26:26] [INFO ] Deduced a trap composed of 57 places in 1191 ms of which 12 ms to minimize.
[2024-05-22 09:26:28] [INFO ] Deduced a trap composed of 57 places in 1270 ms of which 12 ms to minimize.
[2024-05-22 09:26:29] [INFO ] Deduced a trap composed of 57 places in 1135 ms of which 14 ms to minimize.
[2024-05-22 09:26:30] [INFO ] Deduced a trap composed of 53 places in 1228 ms of which 12 ms to minimize.
[2024-05-22 09:26:32] [INFO ] Deduced a trap composed of 55 places in 1265 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2755 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:26:33] [INFO ] Deduced a trap composed of 60 places in 1505 ms of which 17 ms to minimize.
[2024-05-22 09:26:35] [INFO ] Deduced a trap composed of 58 places in 1436 ms of which 13 ms to minimize.
[2024-05-22 09:26:36] [INFO ] Deduced a trap composed of 55 places in 1466 ms of which 14 ms to minimize.
[2024-05-22 09:26:38] [INFO ] Deduced a trap composed of 55 places in 1345 ms of which 13 ms to minimize.
[2024-05-22 09:26:39] [INFO ] Deduced a trap composed of 58 places in 1361 ms of which 12 ms to minimize.
[2024-05-22 09:26:40] [INFO ] Deduced a trap composed of 61 places in 1387 ms of which 14 ms to minimize.
[2024-05-22 09:26:42] [INFO ] Deduced a trap composed of 53 places in 1299 ms of which 12 ms to minimize.
[2024-05-22 09:26:43] [INFO ] Deduced a trap composed of 53 places in 1451 ms of which 12 ms to minimize.
[2024-05-22 09:26:45] [INFO ] Deduced a trap composed of 55 places in 1334 ms of which 12 ms to minimize.
[2024-05-22 09:26:46] [INFO ] Deduced a trap composed of 57 places in 1190 ms of which 12 ms to minimize.
[2024-05-22 09:26:47] [INFO ] Deduced a trap composed of 53 places in 1166 ms of which 11 ms to minimize.
[2024-05-22 09:26:48] [INFO ] Deduced a trap composed of 53 places in 1289 ms of which 12 ms to minimize.
[2024-05-22 09:26:50] [INFO ] Deduced a trap composed of 55 places in 1255 ms of which 12 ms to minimize.
[2024-05-22 09:26:51] [INFO ] Deduced a trap composed of 53 places in 1221 ms of which 11 ms to minimize.
[2024-05-22 09:26:52] [INFO ] Deduced a trap composed of 53 places in 1252 ms of which 13 ms to minimize.
[2024-05-22 09:26:53] [INFO ] Deduced a trap composed of 56 places in 1121 ms of which 11 ms to minimize.
[2024-05-22 09:26:55] [INFO ] Deduced a trap composed of 56 places in 1169 ms of which 11 ms to minimize.
[2024-05-22 09:26:56] [INFO ] Deduced a trap composed of 53 places in 1182 ms of which 12 ms to minimize.
[2024-05-22 09:26:57] [INFO ] Deduced a trap composed of 56 places in 1124 ms of which 12 ms to minimize.
[2024-05-22 09:26:58] [INFO ] Deduced a trap composed of 57 places in 1065 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2755 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:27:00] [INFO ] Deduced a trap composed of 55 places in 1373 ms of which 13 ms to minimize.
[2024-05-22 09:27:01] [INFO ] Deduced a trap composed of 53 places in 1298 ms of which 12 ms to minimize.
[2024-05-22 09:27:02] [INFO ] Deduced a trap composed of 56 places in 1363 ms of which 12 ms to minimize.
[2024-05-22 09:27:04] [INFO ] Deduced a trap composed of 53 places in 1285 ms of which 11 ms to minimize.
[2024-05-22 09:27:05] [INFO ] Deduced a trap composed of 55 places in 1281 ms of which 12 ms to minimize.
[2024-05-22 09:27:06] [INFO ] Deduced a trap composed of 58 places in 1186 ms of which 12 ms to minimize.
[2024-05-22 09:27:07] [INFO ] Deduced a trap composed of 57 places in 1104 ms of which 11 ms to minimize.
[2024-05-22 09:27:08] [INFO ] Deduced a trap composed of 56 places in 1067 ms of which 11 ms to minimize.
[2024-05-22 09:27:10] [INFO ] Deduced a trap composed of 56 places in 1127 ms of which 12 ms to minimize.
[2024-05-22 09:27:11] [INFO ] Deduced a trap composed of 56 places in 1075 ms of which 11 ms to minimize.
[2024-05-22 09:27:12] [INFO ] Deduced a trap composed of 57 places in 1087 ms of which 12 ms to minimize.
[2024-05-22 09:27:13] [INFO ] Deduced a trap composed of 57 places in 1136 ms of which 12 ms to minimize.
[2024-05-22 09:27:14] [INFO ] Deduced a trap composed of 55 places in 1017 ms of which 10 ms to minimize.
[2024-05-22 09:27:15] [INFO ] Deduced a trap composed of 56 places in 1087 ms of which 12 ms to minimize.
[2024-05-22 09:27:17] [INFO ] Deduced a trap composed of 53 places in 1314 ms of which 12 ms to minimize.
SMT process timed out in 80394ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 93 out of 2812 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 5249/5249 transitions.
Applied a total of 0 rules in 276 ms. Remains 2812 /2812 variables (removed 0) and now considering 5249/5249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 2812/2812 places, 5249/5249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 5249/5249 transitions.
Applied a total of 0 rules in 294 ms. Remains 2812 /2812 variables (removed 0) and now considering 5249/5249 (removed 0) transitions.
[2024-05-22 09:27:17] [INFO ] Invariant cache hit.
[2024-05-22 09:27:19] [INFO ] Implicit Places using invariants in 2083 ms returned [5, 10, 16, 20, 26, 32, 36, 42, 46, 52, 58, 64, 70, 74, 78, 84, 92, 98, 104, 108, 114, 120, 126, 132, 136, 142, 148, 154, 160, 164, 170, 176, 182, 186, 192, 201, 207, 213, 219, 223, 227, 233, 245, 253, 259, 265, 269, 275]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 2097 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2764/2812 places, 5249/5249 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 2764 transition count 5209
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 2724 transition count 5209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 2723 transition count 5208
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 2723 transition count 5208
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 2704 transition count 5189
Applied a total of 120 rules in 863 ms. Remains 2704 /2764 variables (removed 60) and now considering 5189/5249 (removed 60) transitions.
// Phase 1: matrix 5189 rows 2704 cols
[2024-05-22 09:27:20] [INFO ] Computed 53 invariants in 70 ms
[2024-05-22 09:27:22] [INFO ] Implicit Places using invariants in 1714 ms returned []
[2024-05-22 09:27:22] [INFO ] Invariant cache hit.
[2024-05-22 09:27:23] [INFO ] State equation strengthened by 4953 read => feed constraints.
[2024-05-22 09:27:54] [INFO ] Performed 1476/2704 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 09:28:19] [INFO ] Implicit Places using invariants and state equation in 56895 ms returned []
Implicit Place search using SMT with State Equation took 58624 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2704/2812 places, 5189/5249 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61881 ms. Remains : 2704/2812 places, 5189/5249 transitions.
RANDOM walk for 40000 steps (110 resets) in 612 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 90474 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 3
Probabilistic random walk after 90474 steps, saw 43078 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-22 09:28:22] [INFO ] Invariant cache hit.
[2024-05-22 09:28:22] [INFO ] State equation strengthened by 4953 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2602/2695 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2695 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2695 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/2703 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2703 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5189/7892 variables, 2703/2756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7892 variables, 4953/7709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7892 variables, 0/7709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/7893 variables, 1/7710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7893 variables, 0/7710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/7893 variables, 0/7710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7893/7893 variables, and 7710 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3615 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2704/2704 constraints, ReadFeed: 4953/4953 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2602/2695 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2695 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:28:28] [INFO ] Deduced a trap composed of 2 places in 2109 ms of which 15 ms to minimize.
[2024-05-22 09:28:29] [INFO ] Deduced a trap composed of 57 places in 1330 ms of which 12 ms to minimize.
[2024-05-22 09:28:31] [INFO ] Deduced a trap composed of 53 places in 1188 ms of which 11 ms to minimize.
[2024-05-22 09:28:32] [INFO ] Deduced a trap composed of 55 places in 1170 ms of which 14 ms to minimize.
[2024-05-22 09:28:33] [INFO ] Deduced a trap composed of 53 places in 1146 ms of which 11 ms to minimize.
[2024-05-22 09:28:34] [INFO ] Deduced a trap composed of 53 places in 1090 ms of which 11 ms to minimize.
[2024-05-22 09:28:35] [INFO ] Deduced a trap composed of 58 places in 998 ms of which 11 ms to minimize.
[2024-05-22 09:28:36] [INFO ] Deduced a trap composed of 53 places in 1066 ms of which 11 ms to minimize.
[2024-05-22 09:28:38] [INFO ] Deduced a trap composed of 53 places in 1059 ms of which 11 ms to minimize.
[2024-05-22 09:28:39] [INFO ] Deduced a trap composed of 56 places in 989 ms of which 11 ms to minimize.
[2024-05-22 09:28:40] [INFO ] Deduced a trap composed of 54 places in 1026 ms of which 18 ms to minimize.
[2024-05-22 09:28:41] [INFO ] Deduced a trap composed of 53 places in 1054 ms of which 11 ms to minimize.
[2024-05-22 09:28:42] [INFO ] Deduced a trap composed of 55 places in 951 ms of which 11 ms to minimize.
[2024-05-22 09:28:43] [INFO ] Deduced a trap composed of 53 places in 1015 ms of which 11 ms to minimize.
[2024-05-22 09:28:44] [INFO ] Deduced a trap composed of 53 places in 890 ms of which 10 ms to minimize.
[2024-05-22 09:28:45] [INFO ] Deduced a trap composed of 54 places in 886 ms of which 11 ms to minimize.
[2024-05-22 09:28:46] [INFO ] Deduced a trap composed of 53 places in 933 ms of which 9 ms to minimize.
[2024-05-22 09:28:47] [INFO ] Deduced a trap composed of 53 places in 885 ms of which 10 ms to minimize.
[2024-05-22 09:28:47] [INFO ] Deduced a trap composed of 53 places in 849 ms of which 10 ms to minimize.
[2024-05-22 09:28:48] [INFO ] Deduced a trap composed of 59 places in 979 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2695 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:28:50] [INFO ] Deduced a trap composed of 53 places in 1094 ms of which 11 ms to minimize.
[2024-05-22 09:28:51] [INFO ] Deduced a trap composed of 54 places in 1027 ms of which 11 ms to minimize.
[2024-05-22 09:28:52] [INFO ] Deduced a trap composed of 53 places in 1001 ms of which 10 ms to minimize.
[2024-05-22 09:28:53] [INFO ] Deduced a trap composed of 57 places in 1041 ms of which 11 ms to minimize.
[2024-05-22 09:28:54] [INFO ] Deduced a trap composed of 53 places in 988 ms of which 11 ms to minimize.
[2024-05-22 09:28:55] [INFO ] Deduced a trap composed of 53 places in 922 ms of which 10 ms to minimize.
[2024-05-22 09:28:56] [INFO ] Deduced a trap composed of 53 places in 880 ms of which 10 ms to minimize.
[2024-05-22 09:28:57] [INFO ] Deduced a trap composed of 61 places in 876 ms of which 10 ms to minimize.
[2024-05-22 09:28:57] [INFO ] Deduced a trap composed of 53 places in 756 ms of which 9 ms to minimize.
[2024-05-22 09:28:58] [INFO ] Deduced a trap composed of 53 places in 672 ms of which 9 ms to minimize.
[2024-05-22 09:28:59] [INFO ] Deduced a trap composed of 56 places in 859 ms of which 9 ms to minimize.
[2024-05-22 09:29:00] [INFO ] Deduced a trap composed of 53 places in 917 ms of which 10 ms to minimize.
[2024-05-22 09:29:01] [INFO ] Deduced a trap composed of 53 places in 958 ms of which 10 ms to minimize.
[2024-05-22 09:29:02] [INFO ] Deduced a trap composed of 54 places in 975 ms of which 10 ms to minimize.
[2024-05-22 09:29:03] [INFO ] Deduced a trap composed of 54 places in 894 ms of which 11 ms to minimize.
[2024-05-22 09:29:04] [INFO ] Deduced a trap composed of 54 places in 821 ms of which 10 ms to minimize.
[2024-05-22 09:29:05] [INFO ] Deduced a trap composed of 54 places in 902 ms of which 11 ms to minimize.
[2024-05-22 09:29:06] [INFO ] Deduced a trap composed of 53 places in 825 ms of which 10 ms to minimize.
[2024-05-22 09:29:06] [INFO ] Deduced a trap composed of 56 places in 757 ms of which 9 ms to minimize.
[2024-05-22 09:29:07] [INFO ] Deduced a trap composed of 54 places in 738 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2695 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:29:08] [INFO ] Deduced a trap composed of 53 places in 1198 ms of which 12 ms to minimize.
[2024-05-22 09:29:09] [INFO ] Deduced a trap composed of 53 places in 873 ms of which 10 ms to minimize.
[2024-05-22 09:29:10] [INFO ] Deduced a trap composed of 53 places in 983 ms of which 11 ms to minimize.
[2024-05-22 09:29:11] [INFO ] Deduced a trap composed of 55 places in 821 ms of which 10 ms to minimize.
[2024-05-22 09:29:12] [INFO ] Deduced a trap composed of 54 places in 787 ms of which 9 ms to minimize.
[2024-05-22 09:29:13] [INFO ] Deduced a trap composed of 54 places in 828 ms of which 10 ms to minimize.
[2024-05-22 09:29:14] [INFO ] Deduced a trap composed of 54 places in 951 ms of which 10 ms to minimize.
[2024-05-22 09:29:15] [INFO ] Deduced a trap composed of 54 places in 853 ms of which 10 ms to minimize.
[2024-05-22 09:29:16] [INFO ] Deduced a trap composed of 53 places in 736 ms of which 9 ms to minimize.
[2024-05-22 09:29:17] [INFO ] Deduced a trap composed of 54 places in 809 ms of which 9 ms to minimize.
[2024-05-22 09:29:17] [INFO ] Deduced a trap composed of 54 places in 837 ms of which 10 ms to minimize.
[2024-05-22 09:29:18] [INFO ] Deduced a trap composed of 58 places in 875 ms of which 10 ms to minimize.
[2024-05-22 09:29:19] [INFO ] Deduced a trap composed of 54 places in 910 ms of which 10 ms to minimize.
[2024-05-22 09:29:20] [INFO ] Deduced a trap composed of 55 places in 975 ms of which 12 ms to minimize.
[2024-05-22 09:29:21] [INFO ] Deduced a trap composed of 54 places in 876 ms of which 9 ms to minimize.
[2024-05-22 09:29:22] [INFO ] Deduced a trap composed of 54 places in 887 ms of which 10 ms to minimize.
[2024-05-22 09:29:23] [INFO ] Deduced a trap composed of 53 places in 944 ms of which 11 ms to minimize.
[2024-05-22 09:29:24] [INFO ] Deduced a trap composed of 53 places in 748 ms of which 10 ms to minimize.
[2024-05-22 09:29:25] [INFO ] Deduced a trap composed of 54 places in 1005 ms of which 10 ms to minimize.
[2024-05-22 09:29:26] [INFO ] Deduced a trap composed of 54 places in 889 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2695 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:29:27] [INFO ] Deduced a trap composed of 53 places in 1102 ms of which 11 ms to minimize.
[2024-05-22 09:29:28] [INFO ] Deduced a trap composed of 57 places in 982 ms of which 11 ms to minimize.
[2024-05-22 09:29:29] [INFO ] Deduced a trap composed of 53 places in 914 ms of which 10 ms to minimize.
[2024-05-22 09:29:30] [INFO ] Deduced a trap composed of 57 places in 1005 ms of which 11 ms to minimize.
[2024-05-22 09:29:31] [INFO ] Deduced a trap composed of 54 places in 951 ms of which 11 ms to minimize.
[2024-05-22 09:29:32] [INFO ] Deduced a trap composed of 54 places in 831 ms of which 9 ms to minimize.
[2024-05-22 09:29:33] [INFO ] Deduced a trap composed of 53 places in 1055 ms of which 11 ms to minimize.
[2024-05-22 09:29:34] [INFO ] Deduced a trap composed of 55 places in 841 ms of which 9 ms to minimize.
[2024-05-22 09:29:35] [INFO ] Deduced a trap composed of 57 places in 1074 ms of which 11 ms to minimize.
[2024-05-22 09:29:36] [INFO ] Deduced a trap composed of 59 places in 1071 ms of which 10 ms to minimize.
[2024-05-22 09:29:37] [INFO ] Deduced a trap composed of 53 places in 801 ms of which 10 ms to minimize.
[2024-05-22 09:29:38] [INFO ] Deduced a trap composed of 54 places in 1019 ms of which 10 ms to minimize.
[2024-05-22 09:29:39] [INFO ] Deduced a trap composed of 53 places in 755 ms of which 9 ms to minimize.
[2024-05-22 09:29:40] [INFO ] Deduced a trap composed of 53 places in 753 ms of which 9 ms to minimize.
[2024-05-22 09:29:41] [INFO ] Deduced a trap composed of 54 places in 761 ms of which 9 ms to minimize.
[2024-05-22 09:29:41] [INFO ] Deduced a trap composed of 55 places in 671 ms of which 8 ms to minimize.
[2024-05-22 09:29:42] [INFO ] Deduced a trap composed of 54 places in 876 ms of which 10 ms to minimize.
[2024-05-22 09:29:43] [INFO ] Deduced a trap composed of 54 places in 808 ms of which 10 ms to minimize.
[2024-05-22 09:29:44] [INFO ] Deduced a trap composed of 53 places in 880 ms of which 10 ms to minimize.
[2024-05-22 09:29:45] [INFO ] Deduced a trap composed of 55 places in 636 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2695 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:29:46] [INFO ] Deduced a trap composed of 53 places in 986 ms of which 11 ms to minimize.
[2024-05-22 09:29:47] [INFO ] Deduced a trap composed of 54 places in 856 ms of which 10 ms to minimize.
[2024-05-22 09:29:48] [INFO ] Deduced a trap composed of 53 places in 1117 ms of which 10 ms to minimize.
[2024-05-22 09:29:49] [INFO ] Deduced a trap composed of 61 places in 904 ms of which 11 ms to minimize.
[2024-05-22 09:29:50] [INFO ] Deduced a trap composed of 54 places in 875 ms of which 9 ms to minimize.
[2024-05-22 09:29:51] [INFO ] Deduced a trap composed of 53 places in 937 ms of which 11 ms to minimize.
[2024-05-22 09:29:52] [INFO ] Deduced a trap composed of 58 places in 949 ms of which 11 ms to minimize.
[2024-05-22 09:29:52] [INFO ] Deduced a trap composed of 54 places in 740 ms of which 9 ms to minimize.
[2024-05-22 09:29:53] [INFO ] Deduced a trap composed of 59 places in 933 ms of which 11 ms to minimize.
[2024-05-22 09:29:55] [INFO ] Deduced a trap composed of 54 places in 960 ms of which 11 ms to minimize.
[2024-05-22 09:29:55] [INFO ] Deduced a trap composed of 53 places in 810 ms of which 11 ms to minimize.
[2024-05-22 09:29:56] [INFO ] Deduced a trap composed of 55 places in 651 ms of which 9 ms to minimize.
SMT process timed out in 94166ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 93 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 5189/5189 transitions.
Applied a total of 0 rules in 286 ms. Remains 2704 /2704 variables (removed 0) and now considering 5189/5189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 2704/2704 places, 5189/5189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 5189/5189 transitions.
Applied a total of 0 rules in 306 ms. Remains 2704 /2704 variables (removed 0) and now considering 5189/5189 (removed 0) transitions.
[2024-05-22 09:29:57] [INFO ] Invariant cache hit.
[2024-05-22 09:29:58] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2024-05-22 09:29:58] [INFO ] Invariant cache hit.
[2024-05-22 09:30:00] [INFO ] State equation strengthened by 4953 read => feed constraints.
[2024-05-22 09:30:30] [INFO ] Performed 1499/2704 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 09:30:56] [INFO ] Implicit Places using invariants and state equation in 57187 ms returned []
Implicit Place search using SMT with State Equation took 58892 ms to find 0 implicit places.
[2024-05-22 09:30:56] [INFO ] Redundant transitions in 410 ms returned []
Running 5139 sub problems to find dead transitions.
[2024-05-22 09:30:56] [INFO ] Invariant cache hit.
[2024-05-22 09:30:56] [INFO ] State equation strengthened by 4953 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2703 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5139 unsolved
SMT process timed out in 35008ms, After SMT, problems are : Problem set: 0 solved, 5139 unsolved
Search for dead transitions found 0 dead transitions in 35075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94717 ms. Remains : 2704/2704 places, 5189/5189 transitions.
[2024-05-22 09:31:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-22 09:31:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 5189 transitions and 20479 arcs took 25 ms.
[2024-05-22 09:31:32] [INFO ] Flatten gal took : 296 ms
Total runtime 399843 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-050

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: 2704
TRANSITIONS: 5189
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.114s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.014s, Sys 0.003s]


----------------------------------------------------------------------
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: 1137
MODEL NAME: /home/mcc/execution/412/model
2704 places, 5189 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-050"
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 CANConstruction-PT-050, 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 r069-tall-171620503700046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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