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.r135-tall-171631131400559.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 DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 169K 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 DoubleExponent-PT-010-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716377672128

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:34:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:34:33] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-22 11:34:33] [INFO ] Transformed 534 places.
[2024-05-22 11:34:33] [INFO ] Transformed 498 transitions.
[2024-05-22 11:34:33] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1313 resets) in 1459 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (104 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (105 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (111 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (106 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 165729 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 16
Probabilistic random walk after 165729 steps, saw 82884 distinct states, run finished after 3008 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 498 rows 534 cols
[2024-05-22 11:34:37] [INFO ] Computed 54 invariants in 60 ms
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, 16 unsolved
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-02 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-05 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-07 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 266/446 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 88/534 variables, 49/54 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 498/1032 variables, 534/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 588 constraints, problems are : Problem set: 4 solved, 12 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 321/405 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 83 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 311 places in 152 ms of which 5 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 324 places in 153 ms of which 8 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 314 places in 147 ms of which 11 ms to minimize.
[2024-05-22 11:34:40] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 3 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 320 places in 122 ms of which 18 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 334 places in 135 ms of which 14 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 325 places in 104 ms of which 2 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 318 places in 137 ms of which 3 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 331 places in 136 ms of which 7 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 323 places in 174 ms of which 3 ms to minimize.
[2024-05-22 11:34:41] [INFO ] Deduced a trap composed of 337 places in 126 ms of which 2 ms to minimize.
[2024-05-22 11:34:42] [INFO ] Deduced a trap composed of 328 places in 130 ms of which 2 ms to minimize.
[2024-05-22 11:34:42] [INFO ] Deduced a trap composed of 334 places in 144 ms of which 3 ms to minimize.
[2024-05-22 11:34:42] [INFO ] Deduced a trap composed of 317 places in 130 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 15/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 10/415 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 119/534 variables, 51/69 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-22 11:34:43] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2024-05-22 11:34:44] [INFO ] Deduced a trap composed of 192 places in 125 ms of which 3 ms to minimize.
SMT process timed out in 7552ms, After SMT, problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 530 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 530 transition count 443
Reduce places removed 55 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 77 rules applied. Total rules applied 133 place count 475 transition count 421
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 155 place count 453 transition count 421
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 155 place count 453 transition count 399
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 199 place count 431 transition count 399
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 299 place count 381 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 323 place count 369 transition count 349
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 361 place count 369 transition count 311
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 399 place count 331 transition count 311
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 433 place count 331 transition count 311
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 434 place count 331 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 435 place count 330 transition count 310
Applied a total of 435 rules in 197 ms. Remains 330 /534 variables (removed 204) and now considering 310/498 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 330/534 places, 310/498 transitions.
RANDOM walk for 40000 steps (2282 resets) in 377 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1783 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1783 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1783 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1749 resets) in 293 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1752 resets) in 117 ms. (338 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1781 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1769 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1771 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1777 resets) in 286 ms. (139 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1778 resets) in 321 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1783 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 208835 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :2 out of 12
Probabilistic random walk after 208835 steps, saw 104483 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :2
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 310 rows 330 cols
[2024-05-22 11:34:49] [INFO ] Computed 51 invariants in 19 ms
[2024-05-22 11:34:49] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 225/264 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/268 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 36/304 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 310/614 variables, 304/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 22/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 26/640 variables, 26/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/640 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 403 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 330/330 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 225/264 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:34:50] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/268 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 36/304 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 310/614 variables, 304/356 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 22/378 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 26/640 variables, 26/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:34:52] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 5 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:34:53] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-05-22 11:34:54] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 15/429 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:34:55] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/640 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/640 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/640 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 430 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 330/330 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 17/17 constraints]
After SMT, in 8584ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30002 ms.
Support contains 39 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 310/310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 330 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 326 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 324 transition count 304
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 324 transition count 299
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 319 transition count 299
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 3 with 38 rules applied. Total rules applied 60 place count 300 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 294 transition count 281
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 83 place count 294 transition count 270
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 94 place count 283 transition count 270
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 103 place count 283 transition count 270
Applied a total of 103 rules in 67 ms. Remains 283 /330 variables (removed 47) and now considering 270/310 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 283/330 places, 270/310 transitions.
RANDOM walk for 40000 steps (3433 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2372 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2389 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2361 resets) in 391 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2406 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2344 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2358 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2341 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2361 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2382 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2373 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 236125 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 10
Probabilistic random walk after 236125 steps, saw 118110 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 270 rows 283 cols
[2024-05-22 11:35:31] [INFO ] Computed 51 invariants in 22 ms
[2024-05-22 11:35:31] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 199/238 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/242 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/267 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 270/537 variables, 267/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 35/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 16/553 variables, 16/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/553 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 369 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 283/283 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 199/238 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/242 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/267 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 270/537 variables, 267/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 35/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:35:32] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 16/553 variables, 16/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:35:34] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:35:35] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:35:35] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:35:35] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:35:36] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/553 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 283/283 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 12/12 constraints]
After SMT, in 5931ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 41810 ms.
Support contains 39 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 270/270 transitions.
Applied a total of 0 rules in 29 ms. Remains 283 /283 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 283/283 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 283 /283 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-22 11:36:19] [INFO ] Invariant cache hit.
[2024-05-22 11:36:19] [INFO ] Implicit Places using invariants in 187 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 282/283 places, 270/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 281 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 281 transition count 269
Applied a total of 2 rules in 14 ms. Remains 281 /282 variables (removed 1) and now considering 269/270 (removed 1) transitions.
// Phase 1: matrix 269 rows 281 cols
[2024-05-22 11:36:19] [INFO ] Computed 50 invariants in 10 ms
[2024-05-22 11:36:19] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-22 11:36:19] [INFO ] Invariant cache hit.
[2024-05-22 11:36:19] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 11:36:20] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned [56, 63, 86, 92, 114, 123, 154, 179, 184, 227, 272, 278]
[2024-05-22 11:36:20] [INFO ] Actually due to overlaps returned [63, 227, 56, 154, 179, 184]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1280 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/283 places, 269/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 275 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 268
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 274 transition count 268
Applied a total of 4 rules in 22 ms. Remains 274 /275 variables (removed 1) and now considering 268/269 (removed 1) transitions.
// Phase 1: matrix 268 rows 274 cols
[2024-05-22 11:36:20] [INFO ] Computed 44 invariants in 11 ms
[2024-05-22 11:36:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 11:36:20] [INFO ] Invariant cache hit.
[2024-05-22 11:36:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 11:36:21] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned [83, 89, 111, 120, 265, 271]
[2024-05-22 11:36:21] [INFO ] Actually due to overlaps returned [89, 83, 265, 271]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1267 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 270/283 places, 268/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 267
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 269 transition count 267
Applied a total of 4 rules in 29 ms. Remains 269 /270 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 269 cols
[2024-05-22 11:36:21] [INFO ] Computed 40 invariants in 10 ms
[2024-05-22 11:36:22] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 11:36:22] [INFO ] Invariant cache hit.
[2024-05-22 11:36:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 11:36:23] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned [109, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1314 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 267/283 places, 267/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 267 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 266 transition count 266
Applied a total of 2 rules in 12 ms. Remains 266 /267 variables (removed 1) and now considering 266/267 (removed 1) transitions.
// Phase 1: matrix 266 rows 266 cols
[2024-05-22 11:36:23] [INFO ] Computed 38 invariants in 12 ms
[2024-05-22 11:36:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 11:36:23] [INFO ] Invariant cache hit.
[2024-05-22 11:36:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 11:36:24] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 266/283 places, 266/270 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 5122 ms. Remains : 266/283 places, 266/270 transitions.
RANDOM walk for 40000 steps (3424 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2377 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2357 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2363 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2379 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2391 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2439 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2365 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2362 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2403 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2387 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 272395 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 10
Probabilistic random walk after 272395 steps, saw 136249 distinct states, run finished after 3003 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-22 11:36:27] [INFO ] Invariant cache hit.
[2024-05-22 11:36:27] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/227 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/231 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 16/247 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 265/512 variables, 247/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 34/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 20/532 variables, 19/338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 339 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/227 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/231 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 16/247 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 265/512 variables, 247/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 34/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:36:29] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 20/532 variables, 19/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 11:36:30] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:36:30] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:36:30] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:36:31] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 5065ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 39 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 266/266 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 266/266 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-22 11:37:02] [INFO ] Invariant cache hit.
[2024-05-22 11:37:02] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 11:37:02] [INFO ] Invariant cache hit.
[2024-05-22 11:37:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 11:37:03] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2024-05-22 11:37:03] [INFO ] Redundant transitions in 23 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 11:37:03] [INFO ] Invariant cache hit.
[2024-05-22 11:37:03] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/532 variables, 266/304 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 35/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 339 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/532 variables, 266/304 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 35/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 265/604 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 11:37:36] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:37:37] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 11:37:47] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 7 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:37:48] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:37:49] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-22 11:37:49] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:37:49] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:37:51] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:37:52] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
After SMT, in 49578ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 49582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50647 ms. Remains : 266/266 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 266 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 264 transition count 264
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 4 place count 264 transition count 250
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 250 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 246 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 246 transition count 246
Applied a total of 40 rules in 13 ms. Remains 246 /266 variables (removed 20) and now considering 246/266 (removed 20) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 246 rows 246 cols
[2024-05-22 11:37:53] [INFO ] Computed 38 invariants in 14 ms
[2024-05-22 11:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 11:37:53] [INFO ] [Real]Absence check using 2 positive and 36 generalized place invariants in 18 ms returned sat
[2024-05-22 11:37:53] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 11:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 11:37:53] [INFO ] [Nat]Absence check using 2 positive and 36 generalized place invariants in 20 ms returned sat
[2024-05-22 11:37:54] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-22 11:37:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 11:37:54] [INFO ] After 433ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-22 11:37:54] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:37:54] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 668 ms
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-22 11:37:55] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2024-05-22 11:37:56] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:37:56] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:37:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-22 11:37:56] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 11:37:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 2
[2024-05-22 11:37:57] [INFO ] After 3051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-22 11:37:57] [INFO ] After 3974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 4166 ms.
[2024-05-22 11:37:57] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-22 11:37:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 266 transitions and 1191 arcs took 4 ms.
[2024-05-22 11:37:57] [INFO ] Flatten gal took : 52 ms
Total runtime 204473 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-010

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 266
TRANSITIONS: 266
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 924
MODEL NAME: /home/mcc/execution/414/model
266 places, 266 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 22 steps.
Creating all event NSFs..
Convergence in 22 steps.
Creating all event NSFs..
Convergence in 22 steps.
Creating all event NSFs..
Convergence in 22 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 46 steps.
Creating all event NSFs..
Convergence in 46 steps.
Creating all event NSFs..
Convergence in 46 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 46 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Convergence in 74 steps.
Creating all event NSFs..
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 212 steps.
Convergence in 212 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 212 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 212 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 706 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 706 steps.
Convergence in 706 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 706 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1358 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1358 steps.
Creating all event NSFs..
Convergence in 1358 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 2749 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2749 steps.
Creating all event NSFs..
Convergence in 2749 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 615 steps.
Creating all event NSFs..
Convergence in 2749 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 615 steps.
Creating all event NSFs..
Convergence in 615 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 615 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716378079314

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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 r135-tall-171631131400559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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