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.r355-tall-171683759700874.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 ShieldRVs-PT-100B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700874
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 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 ShieldRVs-PT-100B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-100B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717070283060

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 11:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 11:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:58:04] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-05-30 11:58:04] [INFO ] Transformed 4003 places.
[2024-05-30 11:58:04] [INFO ] Transformed 4503 transitions.
[2024-05-30 11:58:04] [INFO ] Found NUPN structural information;
[2024-05-30 11:58:04] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 198 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 653 places :
Symmetric choice reduction at 0 with 653 rule applications. Total rules 653 place count 3350 transition count 3850
Iterating global reduction 0 with 653 rules applied. Total rules applied 1306 place count 3350 transition count 3850
Applied a total of 1306 rules in 738 ms. Remains 3350 /4003 variables (removed 653) and now considering 3850/4503 (removed 653) transitions.
// Phase 1: matrix 3850 rows 3350 cols
[2024-05-30 11:58:05] [INFO ] Computed 401 invariants in 52 ms
[2024-05-30 11:58:07] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2024-05-30 11:58:07] [INFO ] Invariant cache hit.
[2024-05-30 11:58:11] [INFO ] Implicit Places using invariants and state equation in 4066 ms returned []
Implicit Place search using SMT with State Equation took 5372 ms to find 0 implicit places.
Running 3849 sub problems to find dead transitions.
[2024-05-30 11:58:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3349/7200 variables, and 0 constraints, problems are : Problem set: 0 solved, 3849 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3350 constraints, PredecessorRefiner: 3849/3849 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3349/7200 variables, and 0 constraints, problems are : Problem set: 0 solved, 3849 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3350 constraints, PredecessorRefiner: 0/3849 constraints, Known Traps: 0/0 constraints]
After SMT, in 62152ms problems are : Problem set: 0 solved, 3849 unsolved
Search for dead transitions found 0 dead transitions in 62216ms
Starting structural reductions in LTL mode, iteration 1 : 3350/4003 places, 3850/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68366 ms. Remains : 3350/4003 places, 3850/4503 transitions.
Support contains 198 out of 3350 places after structural reductions.
[2024-05-30 11:59:13] [INFO ] Flatten gal took : 286 ms
[2024-05-30 11:59:14] [INFO ] Flatten gal took : 180 ms
[2024-05-30 11:59:14] [INFO ] Input system was already deterministic with 3850 transitions.
Support contains 185 out of 3350 places (down from 198) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2755 ms. (14 steps per ms) remains 25/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
[2024-05-30 11:59:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 551/606 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2744/3350 variables, 348/401 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3350 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 3850/7200 variables, 3350/3751 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7200/7200 variables, and 3751 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3350/3350 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 551/606 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 11:59:20] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 14 ms to minimize.
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 2 ms to minimize.
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 2 ms to minimize.
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 109 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 109 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 11:59:21] [INFO ] Deduced a trap composed of 104 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/606 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3350 variables, 348/408 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 11:59:24] [INFO ] Deduced a trap composed of 43 places in 816 ms of which 15 ms to minimize.
[2024-05-30 11:59:25] [INFO ] Deduced a trap composed of 30 places in 845 ms of which 12 ms to minimize.
[2024-05-30 11:59:26] [INFO ] Deduced a trap composed of 41 places in 846 ms of which 12 ms to minimize.
SMT process timed out in 10408ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 3350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 3350 transition count 3463
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 2963 transition count 3463
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 774 place count 2963 transition count 2964
Deduced a syphon composed of 499 places in 10 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1772 place count 2464 transition count 2964
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1805 place count 2431 transition count 2931
Iterating global reduction 2 with 33 rules applied. Total rules applied 1838 place count 2431 transition count 2931
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1838 place count 2431 transition count 2915
Deduced a syphon composed of 16 places in 25 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1870 place count 2415 transition count 2915
Performed 974 Post agglomeration using F-continuation condition.Transition count delta: 974
Deduced a syphon composed of 974 places in 6 ms
Reduce places removed 974 places and 0 transitions.
Iterating global reduction 2 with 1948 rules applied. Total rules applied 3818 place count 1441 transition count 1941
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 197 times.
Drop transitions (Partial Free agglomeration) removed 197 transitions
Iterating global reduction 2 with 197 rules applied. Total rules applied 4015 place count 1441 transition count 1941
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4016 place count 1440 transition count 1940
Applied a total of 4016 rules in 1224 ms. Remains 1440 /3350 variables (removed 1910) and now considering 1940/3850 (removed 1910) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 1440/3350 places, 1940/3850 transitions.
RANDOM walk for 40000 steps (32 resets) in 1002 ms. (39 steps per ms) remains 5/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/4 properties
// Phase 1: matrix 1940 rows 1440 cols
[2024-05-30 11:59:28] [INFO ] Computed 401 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/61 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:28] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 144/205 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 403/608 variables, 141/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 25/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 11:59:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 31/639 variables, 17/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 25/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 9/648 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/648 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 374/1022 variables, 163/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1022 variables, 37/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1022 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 24/1046 variables, 12/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1046 variables, 24/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1046 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 256/1302 variables, 104/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1302 variables, 28/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1302 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 16/1318 variables, 8/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1318 variables, 16/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1318 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 231/1549 variables, 95/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1549 variables, 23/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1549 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 15/1564 variables, 8/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1564 variables, 15/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1564 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 155/1719 variables, 66/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1719 variables, 16/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1719 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 11/1730 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1730 variables, 9/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1730 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 127/1857 variables, 52/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1857 variables, 13/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1857 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 8/1865 variables, 4/992 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1865 variables, 8/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1865 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 128/1993 variables, 50/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1993 variables, 12/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1993 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 8/2001 variables, 4/1066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2001 variables, 8/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2001 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 124/2125 variables, 48/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2125 variables, 12/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2125 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 8/2133 variables, 4/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2133 variables, 8/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2133 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 124/2257 variables, 48/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2257 variables, 12/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2257 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/2265 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2265 variables, 8/1218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2265 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 127/2392 variables, 49/1267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2392 variables, 11/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2392 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 9/2401 variables, 5/1283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2401 variables, 9/1292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2401 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 124/2525 variables, 48/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2525 variables, 11/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2525 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 10/2535 variables, 5/1356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2535 variables, 8/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2535 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 113/2648 variables, 50/1414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2648 variables, 13/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2648 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 6/2654 variables, 3/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2654 variables, 6/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2654 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 93/2747 variables, 36/1472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2747 variables, 9/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2747 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 6/2753 variables, 3/1484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2753 variables, 6/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2753 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 90/2843 variables, 36/1526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2843 variables, 9/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2843 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 7/2850 variables, 3/1538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2850 variables, 4/1542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2850 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 97/2947 variables, 39/1581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2947 variables, 9/1590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2947 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 6/2953 variables, 3/1593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2953 variables, 6/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2953 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 93/3046 variables, 36/1635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3046 variables, 9/1644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/3046 variables, 0/1644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 6/3052 variables, 3/1647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3052 variables, 6/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3052 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 93/3145 variables, 36/1689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/3145 variables, 9/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3145 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 6/3151 variables, 3/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/3151 variables, 6/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3151 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 93/3244 variables, 36/1743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/3244 variables, 9/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3244 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 6/3250 variables, 3/1755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/3250 variables, 6/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3250 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 88/3338 variables, 37/1798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3338 variables, 9/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3338 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 7/3345 variables, 3/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3345 variables, 4/1814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3345 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 35/3380 variables, 24/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3380 variables, 7/1845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3380 variables, 0/1845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 0/3380 variables, 0/1845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3380/3380 variables, and 1845 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1440/1440 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/61 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 144/205 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 403/608 variables, 141/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 25/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 31/639 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 25/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:32] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/639 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/639 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 9/648 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/648 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/648 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 374/1022 variables, 163/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1022 variables, 37/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1022 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1022 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 24/1046 variables, 12/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1046 variables, 24/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1046 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1046 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 256/1302 variables, 104/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1302 variables, 28/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:59:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:59:34] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:59:34] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1302 variables, 5/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1302 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 16/1318 variables, 8/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1318 variables, 16/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:34] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1318 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1318 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 231/1549 variables, 95/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1549 variables, 23/817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:34] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:59:34] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1549 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1549 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 15/1564 variables, 8/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1564 variables, 15/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1564 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1564 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 155/1719 variables, 66/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1719 variables, 16/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-30 11:59:35] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1719 variables, 5/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:36] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 5 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1719 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1719 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 11/1730 variables, 6/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1730 variables, 9/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1730 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 127/1857 variables, 52/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1857 variables, 13/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1857 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 8/1865 variables, 4/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1865 variables, 8/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1865 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 128/1993 variables, 50/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1993 variables, 12/1085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:36] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-05-30 11:59:36] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:59:37] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1993 variables, 3/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1993 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 8/2001 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2001 variables, 8/1100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2001 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 124/2125 variables, 48/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2125 variables, 12/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:37] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:59:37] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-05-30 11:59:37] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2024-05-30 11:59:38] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:59:38] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:59:38] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/2125 variables, 6/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2125 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 8/2133 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2133 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2133 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 124/2257 variables, 48/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2257 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:38] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/2257 variables, 1/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2257 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 8/2265 variables, 4/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2265 variables, 8/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2265 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 127/2392 variables, 49/1300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2392 variables, 11/1311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:39] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/2392 variables, 1/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2392 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 9/2401 variables, 5/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2401 variables, 9/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2401 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 124/2525 variables, 48/1374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2525 variables, 11/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2525 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 10/2535 variables, 5/1390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2535 variables, 8/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2535 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 113/2648 variables, 50/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2648 variables, 13/1461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:40] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
At refinement iteration 95 (INCLUDED_ONLY) 0/2648 variables, 1/1462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2648 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 6/2654 variables, 3/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2654 variables, 6/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2654 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 93/2747 variables, 36/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2747 variables, 9/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2747 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 6/2753 variables, 3/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2753 variables, 6/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2753 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 90/2843 variables, 36/1561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2843 variables, 9/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:41] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
At refinement iteration 108 (INCLUDED_ONLY) 0/2843 variables, 1/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2843 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 7/2850 variables, 3/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2850 variables, 4/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2850 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 97/2947 variables, 39/1617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2947 variables, 9/1626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2947 variables, 0/1626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 6/2953 variables, 3/1629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2953 variables, 6/1635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2953 variables, 0/1635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 93/3046 variables, 36/1671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3046 variables, 9/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3046 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 6/3052 variables, 3/1683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3052 variables, 6/1689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3052 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 93/3145 variables, 36/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3145 variables, 9/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/3145 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 6/3151 variables, 3/1737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3151 variables, 6/1743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:42] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:59:43] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
At refinement iteration 130 (INCLUDED_ONLY) 0/3151 variables, 2/1745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3151 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (OVERLAPS) 93/3244 variables, 36/1781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/3244 variables, 9/1790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:43] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 3 ms to minimize.
[2024-05-30 11:59:43] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 3 ms to minimize.
At refinement iteration 134 (INCLUDED_ONLY) 0/3244 variables, 2/1792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3244 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 6/3250 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3250 variables, 6/1801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/3250 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 88/3338 variables, 37/1838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3338 variables, 9/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:44] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
At refinement iteration 141 (INCLUDED_ONLY) 0/3338 variables, 1/1848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/3338 variables, 0/1848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (OVERLAPS) 7/3345 variables, 3/1851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/3345 variables, 4/1855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/3345 variables, 0/1855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 35/3380 variables, 24/1879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/3380 variables, 7/1886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/3380 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 0/3380 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3380/3380 variables, and 1886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12888 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1440/1440 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 42/42 constraints]
After SMT, in 17463ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2429 ms.
Support contains 11 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 1940/1940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1440 transition count 1938
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1438 transition count 1938
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 1438 transition count 1930
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 1430 transition count 1930
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 14 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 56 place count 1412 transition count 1912
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 1412 transition count 1912
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1409 transition count 1909
Applied a total of 64 rules in 318 ms. Remains 1409 /1440 variables (removed 31) and now considering 1909/1940 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 1409/1440 places, 1909/1940 transitions.
RANDOM walk for 40000 steps (32 resets) in 693 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 177549 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 3
Probabilistic random walk after 177549 steps, saw 175634 distinct states, run finished after 3011 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1909 rows 1409 cols
[2024-05-30 11:59:51] [INFO ] Computed 401 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/48 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/58 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 142/200 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 392/592 variables, 140/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 32/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/612 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 376/988 variables, 158/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/988 variables, 40/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:52] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/988 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/988 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 24/1012 variables, 12/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 24/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 256/1268 variables, 104/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1268 variables, 28/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:52] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:59:52] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
[2024-05-30 11:59:52] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:59:52] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1268 variables, 4/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1268 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 16/1284 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1284 variables, 16/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1284 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 228/1512 variables, 94/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1512 variables, 24/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1512 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 14/1526 variables, 7/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1526 variables, 14/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1526 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 153/1679 variables, 66/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1679 variables, 18/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1679 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 8/1687 variables, 4/897 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1687 variables, 8/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1687 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 126/1813 variables, 50/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1813 variables, 13/968 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1813 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 8/1821 variables, 4/972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1821 variables, 8/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1821 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 124/1945 variables, 48/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1945 variables, 12/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1945 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 8/1953 variables, 4/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1953 variables, 8/1052 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1953 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 124/2077 variables, 48/1100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2077 variables, 12/1112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2077 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/2085 variables, 4/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2085 variables, 8/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2085 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 124/2209 variables, 48/1172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2209 variables, 12/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2209 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 8/2217 variables, 4/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2217 variables, 8/1196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2217 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 124/2341 variables, 48/1244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2341 variables, 12/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2341 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 8/2349 variables, 4/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2349 variables, 8/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2349 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 124/2473 variables, 48/1316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2473 variables, 12/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2473 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 8/2481 variables, 4/1332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2481 variables, 8/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2481 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 111/2592 variables, 48/1388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2592 variables, 13/1401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2592 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 6/2598 variables, 3/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2598 variables, 6/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2598 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 93/2691 variables, 36/1446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2691 variables, 9/1455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2691 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 6/2697 variables, 3/1458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2697 variables, 6/1464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2697 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 93/2790 variables, 36/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2790 variables, 9/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2790 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 6/2796 variables, 3/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2796 variables, 6/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2796 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 93/2889 variables, 36/1554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2889 variables, 9/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2889 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 6/2895 variables, 3/1566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2895 variables, 6/1572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2895 variables, 0/1572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 93/2988 variables, 36/1608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2988 variables, 9/1617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2988 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 6/2994 variables, 3/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2994 variables, 6/1626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2994 variables, 0/1626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 93/3087 variables, 36/1662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3087 variables, 9/1671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3087 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 6/3093 variables, 3/1674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/3093 variables, 6/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3093 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 93/3186 variables, 36/1716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/3186 variables, 9/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3186 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 6/3192 variables, 3/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/3192 variables, 6/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3192 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 89/3281 variables, 36/1770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/3281 variables, 9/1779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3281 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 6/3287 variables, 3/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3287 variables, 6/1788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3287 variables, 0/1788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 31/3318 variables, 21/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3318 variables, 7/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3318 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 0/3318 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3318/3318 variables, and 1816 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4937 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1409/1409 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/48 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/58 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 142/200 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 392/592 variables, 140/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 32/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:57] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/592 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 20/612 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/612 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 376/988 variables, 158/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/988 variables, 40/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/988 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:57] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/988 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/988 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 24/1012 variables, 12/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1012 variables, 24/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1012 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1012 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 256/1268 variables, 104/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1268 variables, 28/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1268 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:57] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:59:57] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1268 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1268 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 16/1284 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1284 variables, 16/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1284 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 228/1512 variables, 94/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1512 variables, 24/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1512 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 14/1526 variables, 7/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1526 variables, 14/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1526 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 153/1679 variables, 66/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1679 variables, 18/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1679 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 8/1687 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1687 variables, 8/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1687 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 126/1813 variables, 50/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1813 variables, 13/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:58] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:59:58] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:59:58] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1813 variables, 3/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1813 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 8/1821 variables, 4/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1821 variables, 8/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1821 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 124/1945 variables, 48/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1945 variables, 12/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1945 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 8/1953 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1953 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1953 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 124/2077 variables, 48/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2077 variables, 12/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2077 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 8/2085 variables, 4/1126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2085 variables, 8/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2085 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 124/2209 variables, 48/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2209 variables, 12/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 11:59:59] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/2209 variables, 1/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2209 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 8/2217 variables, 4/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2217 variables, 8/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2217 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 124/2341 variables, 48/1255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2341 variables, 12/1267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2341 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 8/2349 variables, 4/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2349 variables, 8/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2349 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 124/2473 variables, 48/1327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2473 variables, 12/1339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2473 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 8/2481 variables, 4/1343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2481 variables, 8/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2481 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 111/2592 variables, 48/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2592 variables, 13/1412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2592 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 6/2598 variables, 3/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2598 variables, 6/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2598 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 93/2691 variables, 36/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2691 variables, 9/1466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2691 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 6/2697 variables, 3/1469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2697 variables, 6/1475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2697 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 93/2790 variables, 36/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2790 variables, 9/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2790 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 6/2796 variables, 3/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2796 variables, 6/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2796 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 93/2889 variables, 36/1565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2889 variables, 9/1574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:00:01] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
At refinement iteration 104 (INCLUDED_ONLY) 0/2889 variables, 1/1575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2889 variables, 0/1575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 6/2895 variables, 3/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2895 variables, 6/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2895 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 93/2988 variables, 36/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2988 variables, 9/1629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:00:02] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:00:02] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
At refinement iteration 111 (INCLUDED_ONLY) 0/2988 variables, 2/1631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2988 variables, 0/1631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 6/2994 variables, 3/1634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2994 variables, 6/1640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2994 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 93/3087 variables, 36/1676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3087 variables, 9/1685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:00:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 118 (INCLUDED_ONLY) 0/3087 variables, 7/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/3087 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 6/3093 variables, 3/1695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3093 variables, 6/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3093 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 93/3186 variables, 36/1737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3186 variables, 9/1746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:00:04] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-30 12:00:04] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 125 (INCLUDED_ONLY) 0/3186 variables, 2/1748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3186 variables, 0/1748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 6/3192 variables, 3/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3192 variables, 6/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3192 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 89/3281 variables, 36/1793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3281 variables, 9/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/3281 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 6/3287 variables, 3/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/3287 variables, 6/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3287 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 31/3318 variables, 21/1832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3318 variables, 7/1839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:00:05] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 12:00:05] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:00:05] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 138 (INCLUDED_ONLY) 0/3318 variables, 3/1842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/3318 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (OVERLAPS) 0/3318 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3318/3318 variables, and 1842 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9485 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1409/1409 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 29/29 constraints]
After SMT, in 14460ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1687 ms.
Support contains 11 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 87 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 70 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-30 12:00:08] [INFO ] Invariant cache hit.
[2024-05-30 12:00:08] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-30 12:00:08] [INFO ] Invariant cache hit.
[2024-05-30 12:00:10] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
[2024-05-30 12:00:11] [INFO ] Redundant transitions in 278 ms returned []
Running 1904 sub problems to find dead transitions.
[2024-05-30 12:00:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1405 variables, 394/394 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1405/3318 variables, and 394 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 394/401 constraints, State Equation: 0/1409 constraints, PredecessorRefiner: 1904/1904 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1904 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1405 variables, 394/394 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:00:42] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-30 12:00:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 12:00:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 12:00:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:00:43] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:00:44] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1405 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:00:45] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-30 12:00:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:47] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:47] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:00:47] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-30 12:00:47] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1405 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:00:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2024-05-30 12:00:48] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 12:00:48] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:00:49] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:00:50] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:00:51] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-30 12:00:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1405 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:00:52] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:00:52] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:00:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:00:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 12:00:53] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-30 12:00:53] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:00:53] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:00:53] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-30 12:00:54] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-30 12:00:55] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-30 12:00:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:00:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1405 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:00:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:00:57] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:00:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:00:58] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:00:58] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-30 12:00:58] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 12:00:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1405 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:01:00] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 12:01:00] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-30 12:01:01] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:01:02] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:01:03] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1405 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:01:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:01:04] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 12:01:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-30 12:01:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 12:01:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:01:05] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-30 12:01:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 12:01:05] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:01:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 12:01:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-30 12:01:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:01:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-30 12:01:07] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-30 12:01:07] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1405 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 12:01:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:01:09] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-30 12:01:09] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:01:10] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:01:11] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 12:01:11] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1405 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1405/3318 variables, and 554 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 394/401 constraints, State Equation: 0/1409 constraints, PredecessorRefiner: 0/1904 constraints, Known Traps: 160/160 constraints]
After SMT, in 60766ms problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 60785ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63721 ms. Remains : 1409/1409 places, 1909/1909 transitions.
[2024-05-30 12:01:11] [INFO ] Flatten gal took : 121 ms
[2024-05-30 12:01:12] [INFO ] Flatten gal took : 128 ms
[2024-05-30 12:01:12] [INFO ] Input system was already deterministic with 3850 transitions.
Computed a total of 829 stabilizing places and 829 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 3349 transition count 3456
Reduce places removed 393 places and 0 transitions.
Iterating post reduction 1 with 393 rules applied. Total rules applied 786 place count 2956 transition count 3456
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 786 place count 2956 transition count 2956
Deduced a syphon composed of 500 places in 9 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1786 place count 2456 transition count 2956
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1829 place count 2413 transition count 2913
Iterating global reduction 2 with 43 rules applied. Total rules applied 1872 place count 2413 transition count 2913
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1872 place count 2413 transition count 2895
Deduced a syphon composed of 18 places in 8 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1908 place count 2395 transition count 2895
Performed 972 Post agglomeration using F-continuation condition.Transition count delta: 972
Deduced a syphon composed of 972 places in 6 ms
Reduce places removed 972 places and 0 transitions.
Iterating global reduction 2 with 1944 rules applied. Total rules applied 3852 place count 1423 transition count 1923
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3854 place count 1421 transition count 1921
Applied a total of 3854 rules in 745 ms. Remains 1421 /3350 variables (removed 1929) and now considering 1921/3850 (removed 1929) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 745 ms. Remains : 1421/3350 places, 1921/3850 transitions.
[2024-05-30 12:01:13] [INFO ] Flatten gal took : 65 ms
[2024-05-30 12:01:13] [INFO ] Flatten gal took : 74 ms
[2024-05-30 12:01:13] [INFO ] Input system was already deterministic with 1921 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 3311 transition count 3811
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 3311 transition count 3811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 3310 transition count 3810
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 3310 transition count 3810
Applied a total of 80 rules in 581 ms. Remains 3310 /3350 variables (removed 40) and now considering 3810/3850 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 3310/3350 places, 3810/3850 transitions.
[2024-05-30 12:01:14] [INFO ] Flatten gal took : 125 ms
[2024-05-30 12:01:14] [INFO ] Flatten gal took : 115 ms
[2024-05-30 12:01:14] [INFO ] Input system was already deterministic with 3810 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3306 transition count 3806
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3305 transition count 3805
Applied a total of 90 rules in 599 ms. Remains 3305 /3350 variables (removed 45) and now considering 3805/3850 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-05-30 12:01:15] [INFO ] Flatten gal took : 107 ms
[2024-05-30 12:01:15] [INFO ] Flatten gal took : 116 ms
[2024-05-30 12:01:15] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3305 transition count 3805
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3305 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3304 transition count 3804
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3304 transition count 3804
Applied a total of 92 rules in 551 ms. Remains 3304 /3350 variables (removed 46) and now considering 3804/3850 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-05-30 12:01:16] [INFO ] Flatten gal took : 95 ms
[2024-05-30 12:01:16] [INFO ] Flatten gal took : 102 ms
[2024-05-30 12:01:16] [INFO ] Input system was already deterministic with 3804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 3307 transition count 3807
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 3307 transition count 3807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3306 transition count 3806
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3306 transition count 3806
Applied a total of 88 rules in 548 ms. Remains 3306 /3350 variables (removed 44) and now considering 3806/3850 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 3306/3350 places, 3806/3850 transitions.
[2024-05-30 12:01:17] [INFO ] Flatten gal took : 91 ms
[2024-05-30 12:01:17] [INFO ] Flatten gal took : 96 ms
[2024-05-30 12:01:17] [INFO ] Input system was already deterministic with 3806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3306 transition count 3806
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3305 transition count 3805
Applied a total of 90 rules in 612 ms. Remains 3305 /3350 variables (removed 45) and now considering 3805/3850 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-05-30 12:01:18] [INFO ] Flatten gal took : 90 ms
[2024-05-30 12:01:18] [INFO ] Flatten gal took : 99 ms
[2024-05-30 12:01:18] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3305 transition count 3805
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3305 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3304 transition count 3804
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3304 transition count 3804
Applied a total of 92 rules in 524 ms. Remains 3304 /3350 variables (removed 46) and now considering 3804/3850 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-05-30 12:01:19] [INFO ] Flatten gal took : 89 ms
[2024-05-30 12:01:19] [INFO ] Flatten gal took : 96 ms
[2024-05-30 12:01:19] [INFO ] Input system was already deterministic with 3804 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3349 transition count 3450
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2950 transition count 3450
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 798 place count 2950 transition count 2951
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1796 place count 2451 transition count 2951
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1841 place count 2406 transition count 2906
Iterating global reduction 2 with 45 rules applied. Total rules applied 1886 place count 2406 transition count 2906
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1886 place count 2406 transition count 2886
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1926 place count 2386 transition count 2886
Performed 978 Post agglomeration using F-continuation condition.Transition count delta: 978
Deduced a syphon composed of 978 places in 5 ms
Reduce places removed 978 places and 0 transitions.
Iterating global reduction 2 with 1956 rules applied. Total rules applied 3882 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3884 place count 1406 transition count 1906
Applied a total of 3884 rules in 588 ms. Remains 1406 /3350 variables (removed 1944) and now considering 1906/3850 (removed 1944) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 588 ms. Remains : 1406/3350 places, 1906/3850 transitions.
[2024-05-30 12:01:20] [INFO ] Flatten gal took : 47 ms
[2024-05-30 12:01:20] [INFO ] Flatten gal took : 51 ms
[2024-05-30 12:01:20] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3305 transition count 3805
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3305 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3304 transition count 3804
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3304 transition count 3804
Applied a total of 92 rules in 527 ms. Remains 3304 /3350 variables (removed 46) and now considering 3804/3850 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-05-30 12:01:21] [INFO ] Flatten gal took : 89 ms
[2024-05-30 12:01:21] [INFO ] Flatten gal took : 102 ms
[2024-05-30 12:01:21] [INFO ] Input system was already deterministic with 3804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 3307 transition count 3807
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 3307 transition count 3807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3306 transition count 3806
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3306 transition count 3806
Applied a total of 88 rules in 547 ms. Remains 3306 /3350 variables (removed 44) and now considering 3806/3850 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 3306/3350 places, 3806/3850 transitions.
[2024-05-30 12:01:22] [INFO ] Flatten gal took : 89 ms
[2024-05-30 12:01:22] [INFO ] Flatten gal took : 93 ms
[2024-05-30 12:01:22] [INFO ] Input system was already deterministic with 3806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3306 transition count 3806
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3305 transition count 3805
Applied a total of 90 rules in 529 ms. Remains 3305 /3350 variables (removed 45) and now considering 3805/3850 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-05-30 12:01:23] [INFO ] Flatten gal took : 87 ms
[2024-05-30 12:01:23] [INFO ] Flatten gal took : 92 ms
[2024-05-30 12:01:23] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3306 transition count 3806
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3306 transition count 3806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3305 transition count 3805
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3305 transition count 3805
Applied a total of 90 rules in 533 ms. Remains 3305 /3350 variables (removed 45) and now considering 3805/3850 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-05-30 12:01:23] [INFO ] Flatten gal took : 87 ms
[2024-05-30 12:01:24] [INFO ] Flatten gal took : 93 ms
[2024-05-30 12:01:24] [INFO ] Input system was already deterministic with 3805 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 3349 transition count 3453
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 792 place count 2953 transition count 3453
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 792 place count 2953 transition count 2956
Deduced a syphon composed of 497 places in 8 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1786 place count 2456 transition count 2956
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1829 place count 2413 transition count 2913
Iterating global reduction 2 with 43 rules applied. Total rules applied 1872 place count 2413 transition count 2913
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 1872 place count 2413 transition count 2896
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1906 place count 2396 transition count 2896
Performed 977 Post agglomeration using F-continuation condition.Transition count delta: 977
Deduced a syphon composed of 977 places in 6 ms
Reduce places removed 977 places and 0 transitions.
Iterating global reduction 2 with 1954 rules applied. Total rules applied 3860 place count 1419 transition count 1919
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3862 place count 1417 transition count 1917
Applied a total of 3862 rules in 563 ms. Remains 1417 /3350 variables (removed 1933) and now considering 1917/3850 (removed 1933) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 564 ms. Remains : 1417/3350 places, 1917/3850 transitions.
[2024-05-30 12:01:24] [INFO ] Flatten gal took : 58 ms
[2024-05-30 12:01:24] [INFO ] Flatten gal took : 66 ms
[2024-05-30 12:01:25] [INFO ] Input system was already deterministic with 1917 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 3304 transition count 3804
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 3304 transition count 3804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3303 transition count 3803
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3303 transition count 3803
Applied a total of 94 rules in 632 ms. Remains 3303 /3350 variables (removed 47) and now considering 3803/3850 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 3303/3350 places, 3803/3850 transitions.
[2024-05-30 12:01:25] [INFO ] Flatten gal took : 96 ms
[2024-05-30 12:01:25] [INFO ] Flatten gal took : 105 ms
[2024-05-30 12:01:26] [INFO ] Input system was already deterministic with 3803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3349 transition count 3451
Reduce places removed 398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 399 rules applied. Total rules applied 797 place count 2951 transition count 3450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 798 place count 2950 transition count 3450
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 798 place count 2950 transition count 2951
Deduced a syphon composed of 499 places in 7 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1796 place count 2451 transition count 2951
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1843 place count 2404 transition count 2904
Iterating global reduction 3 with 47 rules applied. Total rules applied 1890 place count 2404 transition count 2904
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1890 place count 2404 transition count 2884
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1930 place count 2384 transition count 2884
Performed 976 Post agglomeration using F-continuation condition.Transition count delta: 976
Deduced a syphon composed of 976 places in 6 ms
Reduce places removed 976 places and 0 transitions.
Iterating global reduction 3 with 1952 rules applied. Total rules applied 3882 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3884 place count 1406 transition count 1906
Applied a total of 3884 rules in 535 ms. Remains 1406 /3350 variables (removed 1944) and now considering 1906/3850 (removed 1944) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 535 ms. Remains : 1406/3350 places, 1906/3850 transitions.
[2024-05-30 12:01:26] [INFO ] Flatten gal took : 54 ms
[2024-05-30 12:01:26] [INFO ] Flatten gal took : 58 ms
[2024-05-30 12:01:26] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3350/3350 places, 3850/3850 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3305 transition count 3805
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3305 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3304 transition count 3804
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3304 transition count 3804
Applied a total of 92 rules in 524 ms. Remains 3304 /3350 variables (removed 46) and now considering 3804/3850 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-05-30 12:01:27] [INFO ] Flatten gal took : 88 ms
[2024-05-30 12:01:27] [INFO ] Flatten gal took : 94 ms
[2024-05-30 12:01:27] [INFO ] Input system was already deterministic with 3804 transitions.
[2024-05-30 12:01:27] [INFO ] Flatten gal took : 94 ms
[2024-05-30 12:01:28] [INFO ] Flatten gal took : 137 ms
[2024-05-30 12:01:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-30 12:01:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3350 places, 3850 transitions and 13094 arcs took 18 ms.
Total runtime 203850 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-100B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.015s, 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: 1333
MODEL NAME: /home/mcc/execution/411/model
3350 places, 3850 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 CTLFireability -timeout 360 -rebuildPNML
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="ShieldRVs-PT-100B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-100B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759700874"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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