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-171620503600017.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-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14: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:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 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 641K 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-020-CTLCardinality-2024-00
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-01
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-02
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-03
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-04
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-05
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-06
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-07
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-08
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-09
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-10
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2024-11
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2023-12
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2023-13
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2023-14
FORMULA_NAME CANConstruction-PT-020-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716361453149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:04:14] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-22 07:04:14] [INFO ] Transformed 1042 places.
[2024-05-22 07:04:14] [INFO ] Transformed 1760 transitions.
[2024-05-22 07:04:14] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 148 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 307 place count 735 transition count 1146
Iterating global reduction 0 with 307 rules applied. Total rules applied 614 place count 735 transition count 1146
Applied a total of 614 rules in 130 ms. Remains 735 /1042 variables (removed 307) and now considering 1146/1760 (removed 614) transitions.
// Phase 1: matrix 1146 rows 735 cols
[2024-05-22 07:04:14] [INFO ] Computed 41 invariants in 35 ms
[2024-05-22 07:04:15] [INFO ] Implicit Places using invariants in 528 ms returned [12, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 208, 236, 250, 264, 278]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 561 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 718/1042 places, 1146/1760 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 704 transition count 1132
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 704 transition count 1132
Applied a total of 28 rules in 57 ms. Remains 704 /718 variables (removed 14) and now considering 1132/1146 (removed 14) transitions.
// Phase 1: matrix 1132 rows 704 cols
[2024-05-22 07:04:15] [INFO ] Computed 24 invariants in 14 ms
[2024-05-22 07:04:15] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-22 07:04:15] [INFO ] Invariant cache hit.
[2024-05-22 07:04:16] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:04:17] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 704/1042 places, 1132/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2847 ms. Remains : 704/1042 places, 1132/1760 transitions.
Support contains 148 out of 704 places after structural reductions.
[2024-05-22 07:04:17] [INFO ] Flatten gal took : 92 ms
[2024-05-22 07:04:17] [INFO ] Flatten gal took : 55 ms
[2024-05-22 07:04:17] [INFO ] Input system was already deterministic with 1132 transitions.
Support contains 142 out of 704 places (down from 148) after GAL structural reductions.
RANDOM walk for 40000 steps (112 resets) in 1762 ms. (22 steps per ms) remains 12/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 11/12 properties
[2024-05-22 07:04:18] [INFO ] Invariant cache hit.
[2024-05-22 07:04:18] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 669/693 variables, 13/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/701 variables, 8/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/703 variables, 2/24 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1132/1835 variables, 703/727 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1835 variables, 780/1507 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1835 variables, 0/1507 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/1836 variables, 1/1508 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1836 variables, 0/1508 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1836 variables, 0/1508 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1836/1836 variables, and 1508 constraints, problems are : Problem set: 8 solved, 3 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 704/704 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 677/688 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-22 07:04:20] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 35 ms to minimize.
[2024-05-22 07:04:20] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 5 ms to minimize.
[2024-05-22 07:04:20] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 5 ms to minimize.
[2024-05-22 07:04:21] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 4 ms to minimize.
[2024-05-22 07:04:21] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 3 ms to minimize.
[2024-05-22 07:04:21] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:04:21] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 5 ms to minimize.
[2024-05-22 07:04:22] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 4 ms to minimize.
[2024-05-22 07:04:22] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:04:22] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:04:22] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:04:22] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 3 ms to minimize.
[2024-05-22 07:04:23] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:04:23] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:04:23] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:04:23] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 4 ms to minimize.
[2024-05-22 07:04:23] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 3 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 3 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 20/29 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 2/31 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/701 variables, 13/44 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 4 ms to minimize.
SMT process timed out in 6168ms, After SMT, problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 704 transition count 1005
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 577 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 576 transition count 1004
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 256 place count 576 transition count 987
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 290 place count 559 transition count 987
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 341 place count 508 transition count 885
Iterating global reduction 3 with 51 rules applied. Total rules applied 392 place count 508 transition count 885
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 14 rules applied. Total rules applied 406 place count 508 transition count 871
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 420 place count 494 transition count 871
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 460 place count 474 transition count 851
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 466 place count 474 transition count 845
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 472 place count 468 transition count 845
Applied a total of 472 rules in 228 ms. Remains 468 /704 variables (removed 236) and now considering 845/1132 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 468/704 places, 845/1132 transitions.
RANDOM walk for 40000 steps (295 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
// Phase 1: matrix 845 rows 468 cols
[2024-05-22 07:04:25] [INFO ] Computed 24 invariants in 4 ms
[2024-05-22 07:04:25] [INFO ] State equation strengthened by 783 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/464 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/467 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 845/1312 variables, 467/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1312 variables, 783/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1313 variables, 1/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1313 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1313 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 1275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 468/468 constraints, ReadFeed: 783/783 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/464 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 6 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 4 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/467 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 845/1312 variables, 467/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1312 variables, 783/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1312 variables, 1/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1312 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1313 variables, 1/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1313 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1313 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 1300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4132 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 468/468 constraints, ReadFeed: 783/783 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 4561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 845/845 transitions.
Applied a total of 0 rules in 43 ms. Remains 468 /468 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 468/468 places, 845/845 transitions.
RANDOM walk for 40000 steps (294 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 701018 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 701018 steps, saw 153535 distinct states, run finished after 3005 ms. (steps per millisecond=233 ) properties seen :0
[2024-05-22 07:04:33] [INFO ] Invariant cache hit.
[2024-05-22 07:04:33] [INFO ] State equation strengthened by 783 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/464 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/467 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 845/1312 variables, 467/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1312 variables, 783/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1313 variables, 1/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1313 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1313 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 1275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 468/468 constraints, ReadFeed: 783/783 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/464 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 6 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/467 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 845/1312 variables, 467/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 783/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1312 variables, 1/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1312 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1313 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1313 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1313 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 1292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2813 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 468/468 constraints, ReadFeed: 783/783 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 845/845 transitions.
Applied a total of 0 rules in 31 ms. Remains 468 /468 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 468/468 places, 845/845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 845/845 transitions.
Applied a total of 0 rules in 30 ms. Remains 468 /468 variables (removed 0) and now considering 845/845 (removed 0) transitions.
[2024-05-22 07:04:36] [INFO ] Invariant cache hit.
[2024-05-22 07:04:36] [INFO ] Implicit Places using invariants in 262 ms returned [8, 45, 52]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 263 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/468 places, 845/845 transitions.
Applied a total of 0 rules in 32 ms. Remains 465 /465 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 325 ms. Remains : 465/468 places, 845/845 transitions.
RANDOM walk for 40000 steps (290 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (14 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 668190 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 668190 steps, saw 150412 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
// Phase 1: matrix 845 rows 465 cols
[2024-05-22 07:04:39] [INFO ] Computed 21 invariants in 8 ms
[2024-05-22 07:04:39] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/464 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 845/1309 variables, 464/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1309 variables, 780/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1309 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1310 variables, 1/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1310 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1310 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1310/1310 variables, and 1266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 465/465 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/464 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 845/1309 variables, 464/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 780/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 1/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1310 variables, 1/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1310 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1310 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1310/1310 variables, and 1299 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5674 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 465/465 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints]
After SMT, in 6033ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 845/845 transitions.
Applied a total of 0 rules in 21 ms. Remains 465 /465 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 465/465 places, 845/845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 845/845 transitions.
Applied a total of 0 rules in 17 ms. Remains 465 /465 variables (removed 0) and now considering 845/845 (removed 0) transitions.
[2024-05-22 07:04:46] [INFO ] Invariant cache hit.
[2024-05-22 07:04:46] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 07:04:46] [INFO ] Invariant cache hit.
[2024-05-22 07:04:46] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:04:47] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-22 07:04:47] [INFO ] Redundant transitions in 52 ms returned []
Running 825 sub problems to find dead transitions.
[2024-05-22 07:04:47] [INFO ] Invariant cache hit.
[2024-05-22 07:04:47] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:04:53] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:04:54] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:04:54] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:04:54] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 4 ms to minimize.
[2024-05-22 07:04:54] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:04:54] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:04:55] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-05-22 07:04:56] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:04:57] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:04:58] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:04:59] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:05:00] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:05:00] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:05:00] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:05:00] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:05:00] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:05:01] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:05:01] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:05:01] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:05:01] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:05:01] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:05:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:05:03] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 3 ms to minimize.
[2024-05-22 07:05:11] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:12] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:05:12] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:05:12] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:05:12] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:05:12] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:05:13] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1310 variables, and 141 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/465 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:24] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:05:24] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:05:24] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-05-22 07:05:24] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:25] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:26] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-22 07:05:26] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:05:26] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:26] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:05:26] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:27] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 3 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:29] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:05:29] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:05:29] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:05:30] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:05:31] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:05:32] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:05:32] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-22 07:05:32] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:05:32] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 3 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 3 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:33] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:34] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:05:35] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:35] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:05:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:38] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:05:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:39] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:43] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:43] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:43] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:05:43] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-22 07:05:45] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:05:45] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:05:45] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:05:45] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/1310 variables, and 361 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/465 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/825 constraints, Known Traps: 340/340 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62256 ms. Remains : 465/465 places, 845/845 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 798 edges and 465 vertex of which 418 / 465 are part of one of the 20 SCC in 3 ms
Free SCC test removed 398 places
Drop transitions (Empty/Sink Transition effects.) removed 776 transitions
Reduce isomorphic transitions removed 776 transitions.
Graph (complete) has 132 edges and 67 vertex of which 10 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 36 output transitions
Drop transitions (Output transitions of discarded places.) removed 36 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 23 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 8 transition count 10
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 29 place count 8 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 7 transition count 9
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 7 transition count 9
Applied a total of 31 rules in 14 ms. Remains 7 /465 variables (removed 458) and now considering 9/845 (removed 836) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 7 cols
[2024-05-22 07:05:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:05:48] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:05:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:05:48] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:05:48] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA CANConstruction-PT-020-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:05:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 39 ms
FORMULA CANConstruction-PT-020-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:05:48] [INFO ] Input system was already deterministic with 1132 transitions.
Support contains 106 out of 704 places (down from 107) after GAL structural reductions.
Computed a total of 67 stabilizing places and 86 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 653 transition count 1033
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 653 transition count 1033
Applied a total of 102 rules in 22 ms. Remains 653 /704 variables (removed 51) and now considering 1033/1132 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 653/704 places, 1033/1132 transitions.
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 29 ms
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 49 ms
[2024-05-22 07:05:48] [INFO ] Input system was already deterministic with 1033 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 648 transition count 1023
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 648 transition count 1023
Applied a total of 112 rules in 23 ms. Remains 648 /704 variables (removed 56) and now considering 1023/1132 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 648/704 places, 1023/1132 transitions.
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 27 ms
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 57 ms
[2024-05-22 07:05:48] [INFO ] Input system was already deterministic with 1023 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 651 transition count 1029
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 651 transition count 1029
Applied a total of 106 rules in 24 ms. Remains 651 /704 variables (removed 53) and now considering 1029/1132 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 651/704 places, 1029/1132 transitions.
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 26 ms
[2024-05-22 07:05:48] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1029 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 704 transition count 1008
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 248 place count 580 transition count 1008
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 248 place count 580 transition count 991
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 282 place count 563 transition count 991
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 329 place count 516 transition count 897
Iterating global reduction 2 with 47 rules applied. Total rules applied 376 place count 516 transition count 897
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 391 place count 516 transition count 882
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 406 place count 501 transition count 882
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 444 place count 482 transition count 863
Applied a total of 444 rules in 101 ms. Remains 482 /704 variables (removed 222) and now considering 863/1132 (removed 269) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 482/704 places, 863/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 863 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 648 transition count 1023
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 648 transition count 1023
Applied a total of 112 rules in 26 ms. Remains 648 /704 variables (removed 56) and now considering 1023/1132 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 648/704 places, 1023/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1023 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 652 transition count 1031
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 652 transition count 1031
Applied a total of 104 rules in 33 ms. Remains 652 /704 variables (removed 52) and now considering 1031/1132 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 652/704 places, 1031/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 25 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1031 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 653 transition count 1032
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 653 transition count 1032
Applied a total of 102 rules in 23 ms. Remains 653 /704 variables (removed 51) and now considering 1032/1132 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 653/704 places, 1032/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1032 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 653 transition count 1033
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 653 transition count 1033
Applied a total of 102 rules in 24 ms. Remains 653 /704 variables (removed 51) and now considering 1033/1132 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 653/704 places, 1033/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1033 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 652 transition count 1031
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 652 transition count 1031
Applied a total of 104 rules in 23 ms. Remains 652 /704 variables (removed 52) and now considering 1031/1132 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 652/704 places, 1031/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 38 ms
[2024-05-22 07:05:49] [INFO ] Input system was already deterministic with 1031 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 652 transition count 1030
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 652 transition count 1030
Applied a total of 104 rules in 27 ms. Remains 652 /704 variables (removed 52) and now considering 1030/1132 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 652/704 places, 1030/1132 transitions.
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:05:49] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:05:50] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 704 transition count 1005
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 577 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 576 transition count 1004
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 256 place count 576 transition count 987
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 290 place count 559 transition count 987
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 338 place count 511 transition count 891
Iterating global reduction 3 with 48 rules applied. Total rules applied 386 place count 511 transition count 891
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 398 place count 511 transition count 879
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 410 place count 499 transition count 879
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 452 place count 478 transition count 858
Applied a total of 452 rules in 66 ms. Remains 478 /704 variables (removed 226) and now considering 858/1132 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 478/704 places, 858/1132 transitions.
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 17 ms
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:05:50] [INFO ] Input system was already deterministic with 858 transitions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 650 transition count 1027
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 650 transition count 1027
Applied a total of 108 rules in 24 ms. Remains 650 /704 variables (removed 54) and now considering 1027/1132 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 650/704 places, 1027/1132 transitions.
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:05:50] [INFO ] Input system was already deterministic with 1027 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 704 transition count 1003
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 258 place count 575 transition count 1003
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 258 place count 575 transition count 986
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 292 place count 558 transition count 986
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 345 place count 505 transition count 880
Iterating global reduction 2 with 53 rules applied. Total rules applied 398 place count 505 transition count 880
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 2 with 17 rules applied. Total rules applied 415 place count 505 transition count 863
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 432 place count 488 transition count 863
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 466 place count 471 transition count 846
Applied a total of 466 rules in 61 ms. Remains 471 /704 variables (removed 233) and now considering 846/1132 (removed 286) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 471/704 places, 846/1132 transitions.
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:05:50] [INFO ] Input system was already deterministic with 846 transitions.
RANDOM walk for 5679 steps (38 resets) in 34 ms. (162 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-020-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 704/704 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 704 transition count 1006
Reduce places removed 126 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 127 rules applied. Total rules applied 253 place count 578 transition count 1005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 254 place count 577 transition count 1005
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 254 place count 577 transition count 988
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 288 place count 560 transition count 988
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 341 place count 507 transition count 882
Iterating global reduction 3 with 53 rules applied. Total rules applied 394 place count 507 transition count 882
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 17 rules applied. Total rules applied 411 place count 507 transition count 865
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 428 place count 490 transition count 865
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 462 place count 473 transition count 848
Applied a total of 462 rules in 61 ms. Remains 473 /704 variables (removed 231) and now considering 848/1132 (removed 284) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 473/704 places, 848/1132 transitions.
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:05:50] [INFO ] Input system was already deterministic with 848 transitions.
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:05:50] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:05:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 07:05:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 1132 transitions and 3879 arcs took 6 ms.
Total runtime 96407 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-020

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: 704
TRANSITIONS: 1132
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.006s]


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


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

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

Process ID: 1921
MODEL NAME: /home/mcc/execution/412/model
704 places, 1132 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-020"
export BK_EXAMINATION="CTLCardinality"
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-020, examination is CTLCardinality"
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-171620503600017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;