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.r528-tall-171683762000874.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 ltsminxred
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 r528-tall-171683762000874
=====================================================================

--------------------
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 1717273289122

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:21:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:21:30] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2024-06-01 20:21:30] [INFO ] Transformed 4003 places.
[2024-06-01 20:21:30] [INFO ] Transformed 4503 transitions.
[2024-06-01 20:21:30] [INFO ] Found NUPN structural information;
[2024-06-01 20:21:30] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 493 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 615 ms. Remains 3350 /4003 variables (removed 653) and now considering 3850/4503 (removed 653) transitions.
// Phase 1: matrix 3850 rows 3350 cols
[2024-06-01 20:21:31] [INFO ] Computed 401 invariants in 56 ms
[2024-06-01 20:21:32] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2024-06-01 20:21:32] [INFO ] Invariant cache hit.
[2024-06-01 20:21:36] [INFO ] Implicit Places using invariants and state equation in 3993 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
Running 3849 sub problems to find dead transitions.
[2024-06-01 20:21:36] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30096 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30056 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 62011ms problems are : Problem set: 0 solved, 3849 unsolved
Search for dead transitions found 0 dead transitions in 62071ms
Starting structural reductions in LTL mode, iteration 1 : 3350/4003 places, 3850/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67965 ms. Remains : 3350/4003 places, 3850/4503 transitions.
Support contains 198 out of 3350 places after structural reductions.
[2024-06-01 20:22:39] [INFO ] Flatten gal took : 295 ms
[2024-06-01 20:22:39] [INFO ] Flatten gal took : 171 ms
[2024-06-01 20:22:40] [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 2955 ms. (13 steps per ms) remains 22/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
[2024-06-01 20:22:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 497/545 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2805/3350 variables, 355/401 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3350 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 3850/7200 variables, 3350/3751 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7200 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 22 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, 22 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3350/3350 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 497/545 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 20:22:46] [INFO ] Deduced a trap composed of 112 places in 194 ms of which 19 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 108 places in 75 ms of which 3 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2805/3350 variables, 355/406 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 20:22:49] [INFO ] Deduced a trap composed of 39 places in 778 ms of which 14 ms to minimize.
[2024-06-01 20:22:50] [INFO ] Deduced a trap composed of 26 places in 857 ms of which 12 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 27 places in 823 ms of which 11 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 26 places in 784 ms of which 10 ms to minimize.
SMT process timed out in 10476ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 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 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 3350 transition count 3462
Reduce places removed 388 places and 0 transitions.
Iterating post reduction 1 with 388 rules applied. Total rules applied 776 place count 2962 transition count 3462
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 776 place count 2962 transition count 2963
Deduced a syphon composed of 499 places in 6 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1774 place count 2463 transition count 2963
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 1808 place count 2429 transition count 2929
Iterating global reduction 2 with 34 rules applied. Total rules applied 1842 place count 2429 transition count 2929
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1842 place count 2429 transition count 2913
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1874 place count 2413 transition count 2913
Performed 974 Post agglomeration using F-continuation condition.Transition count delta: 974
Deduced a syphon composed of 974 places in 16 ms
Reduce places removed 974 places and 0 transitions.
Iterating global reduction 2 with 1948 rules applied. Total rules applied 3822 place count 1439 transition count 1939
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 4019 place count 1439 transition count 1939
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4020 place count 1438 transition count 1938
Applied a total of 4020 rules in 1089 ms. Remains 1438 /3350 variables (removed 1912) and now considering 1938/3850 (removed 1912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1089 ms. Remains : 1438/3350 places, 1938/3850 transitions.
RANDOM walk for 40000 steps (32 resets) in 799 ms. (50 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 3/4 properties
// Phase 1: matrix 1938 rows 1438 cols
[2024-06-01 20:22:53] [INFO ] Computed 401 invariants in 8 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-06-01 20:22:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 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-06-01 20:22:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 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-06-01 20:22:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 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) 126/1991 variables, 49/1049 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1991 variables, 12/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1991 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 8/1999 variables, 4/1065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1999 variables, 8/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1999 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 124/2123 variables, 48/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2123 variables, 12/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2123 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 8/2131 variables, 4/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2131 variables, 8/1145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2131 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 124/2255 variables, 48/1193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2255 variables, 12/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2255 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/2263 variables, 4/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2263 variables, 8/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2263 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 125/2388 variables, 48/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2388 variables, 11/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2388 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 9/2397 variables, 5/1281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2397 variables, 9/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2397 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 124/2521 variables, 48/1338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2521 variables, 11/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2521 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 10/2531 variables, 5/1354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2531 variables, 8/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2531 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 113/2644 variables, 50/1412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2644 variables, 13/1425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2644 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 6/2650 variables, 3/1428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2650 variables, 6/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2650 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 95/2745 variables, 37/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2745 variables, 9/1480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2745 variables, 0/1480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 6/2751 variables, 3/1483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2751 variables, 6/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2751 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 90/2841 variables, 36/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2841 variables, 9/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2841 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 7/2848 variables, 3/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2848 variables, 4/1541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2848 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 97/2945 variables, 39/1580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2945 variables, 9/1589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2945 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 6/2951 variables, 3/1592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2951 variables, 6/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2951 variables, 0/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 93/3044 variables, 36/1634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3044 variables, 9/1643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/3044 variables, 0/1643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 6/3050 variables, 3/1646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3050 variables, 6/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3050 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 93/3143 variables, 36/1688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/3143 variables, 9/1697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3143 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 6/3149 variables, 3/1700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/3149 variables, 6/1706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3149 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 93/3242 variables, 36/1742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/3242 variables, 9/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3242 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 6/3248 variables, 3/1754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/3248 variables, 6/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3248 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 91/3339 variables, 37/1797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3339 variables, 9/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3339 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 6/3345 variables, 3/1809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3345 variables, 6/1815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3345 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 31/3376 variables, 21/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3376 variables, 7/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3376 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 0/3376 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3376/3376 variables, and 1843 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4245 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1438/1438 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
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/608 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 31/639 variables, 17/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 25/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
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
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/648 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/648 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 374/1022 variables, 163/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1022 variables, 37/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1022 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1022 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1022 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1022 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 24/1046 variables, 12/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1046 variables, 24/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1046 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1046 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 256/1302 variables, 104/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1302 variables, 28/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:22:59] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1302 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1302 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 16/1318 variables, 8/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1318 variables, 16/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1318 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 231/1549 variables, 95/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1549 variables, 23/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:22:59] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:22:59] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:23:00] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1549 variables, 3/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1549 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 15/1564 variables, 8/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1564 variables, 15/841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1564 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 155/1719 variables, 66/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1719 variables, 16/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:00] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1719 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1719 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 11/1730 variables, 6/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1730 variables, 9/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1730 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 127/1857 variables, 52/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1857 variables, 13/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:00] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:23:00] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/1857 variables, 2/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1857 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 8/1865 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1865 variables, 8/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1865 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 126/1991 variables, 49/1067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1991 variables, 12/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:01] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1991 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1991 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 8/1999 variables, 4/1084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1999 variables, 8/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1999 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 124/2123 variables, 48/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2123 variables, 12/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:01] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/2123 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2123 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 8/2131 variables, 4/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2131 variables, 8/1165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2131 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 124/2255 variables, 48/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2255 variables, 12/1225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2255 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 8/2263 variables, 4/1229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2263 variables, 8/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2263 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 125/2388 variables, 48/1285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2388 variables, 11/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2388 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 9/2397 variables, 5/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2397 variables, 9/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2397 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 124/2521 variables, 48/1358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2521 variables, 11/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:02] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/2521 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2521 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 10/2531 variables, 5/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2531 variables, 8/1383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2531 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 113/2644 variables, 50/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2644 variables, 13/1446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2644 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 6/2650 variables, 3/1449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2650 variables, 6/1455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2650 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 95/2745 variables, 37/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2745 variables, 9/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
At refinement iteration 101 (INCLUDED_ONLY) 0/2745 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2745 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 6/2751 variables, 3/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2751 variables, 6/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2751 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 90/2841 variables, 36/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2841 variables, 9/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2841 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 7/2848 variables, 3/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2848 variables, 4/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 111 (INCLUDED_ONLY) 0/2848 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2848 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 97/2945 variables, 39/1603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2945 variables, 9/1612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2945 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 6/2951 variables, 3/1615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2951 variables, 6/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:05] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
At refinement iteration 118 (INCLUDED_ONLY) 0/2951 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/2951 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 93/3044 variables, 36/1658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3044 variables, 9/1667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:05] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
At refinement iteration 122 (INCLUDED_ONLY) 0/3044 variables, 1/1668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3044 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 6/3050 variables, 3/1671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3050 variables, 6/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:05] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
At refinement iteration 126 (INCLUDED_ONLY) 0/3050 variables, 1/1678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/3050 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 93/3143 variables, 36/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3143 variables, 9/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
At refinement iteration 130 (INCLUDED_ONLY) 0/3143 variables, 4/1727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3143 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (OVERLAPS) 6/3149 variables, 3/1730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/3149 variables, 6/1736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:07] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
At refinement iteration 134 (INCLUDED_ONLY) 0/3149 variables, 1/1737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3149 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 93/3242 variables, 36/1773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3242 variables, 9/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/3242 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 6/3248 variables, 3/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3248 variables, 6/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/3248 variables, 0/1791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (OVERLAPS) 91/3339 variables, 37/1828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/3339 variables, 9/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/3339 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (OVERLAPS) 6/3345 variables, 3/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/3345 variables, 6/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/3345 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (OVERLAPS) 31/3376 variables, 21/1867 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/3376 variables, 7/1874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
At refinement iteration 150 (INCLUDED_ONLY) 0/3376 variables, 1/1875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/3376 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 0/3376 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3376/3376 variables, and 1875 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11067 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1438/1438 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 33/33 constraints]
After SMT, in 15338ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1436 ms.
Support contains 11 out of 1438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1438/1438 places, 1938/1938 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 1438 transition count 1936
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1436 transition count 1936
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 1436 transition count 1929
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1429 transition count 1929
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 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 57 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 60 place count 1409 transition count 1909
Applied a total of 60 rules in 279 ms. Remains 1409 /1438 variables (removed 29) and now considering 1909/1938 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 1409/1438 places, 1909/1938 transitions.
RANDOM walk for 40000 steps (32 resets) in 673 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 197305 steps, run timeout after 3002 ms. (steps per millisecond=65 ) properties seen :0 out of 3
Probabilistic random walk after 197305 steps, saw 195025 distinct states, run finished after 3007 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 1909 rows 1409 cols
[2024-06-01 20:23:14] [INFO ] Computed 401 invariants in 11 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-06-01 20:23:14] [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-06-01 20:23:14] [INFO ] Deduced a trap composed of 12 places in 40 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-06-01 20:23:15] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1268 variables, 6/648 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/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 16/1284 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1284 variables, 16/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1284 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 228/1512 variables, 94/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1512 variables, 24/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1512 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 14/1526 variables, 7/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1526 variables, 14/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1526 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 153/1679 variables, 66/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1679 variables, 18/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1679 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 8/1687 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1687 variables, 8/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1687 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 126/1813 variables, 50/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1813 variables, 13/970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1813 variables, 5/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1813 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/1821 variables, 4/979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1821 variables, 8/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1821 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 124/1945 variables, 48/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1945 variables, 12/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1945 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 8/1953 variables, 4/1051 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1953 variables, 8/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1953 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 124/2077 variables, 48/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2077 variables, 12/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2077 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 8/2085 variables, 4/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2085 variables, 8/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2085 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 124/2209 variables, 48/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2209 variables, 12/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2209 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 8/2217 variables, 4/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2217 variables, 8/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2217 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 124/2341 variables, 48/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2341 variables, 12/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2341 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 8/2349 variables, 4/1267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2349 variables, 8/1275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2349 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 124/2473 variables, 48/1323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2473 variables, 12/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2473 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 8/2481 variables, 4/1339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2481 variables, 8/1347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2481 variables, 0/1347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 111/2592 variables, 48/1395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2592 variables, 13/1408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2592 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 6/2598 variables, 3/1411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2598 variables, 6/1417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2598 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 93/2691 variables, 36/1453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2691 variables, 9/1462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2691 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 6/2697 variables, 3/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2697 variables, 6/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2697 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 93/2790 variables, 36/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2790 variables, 9/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2790 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 6/2796 variables, 3/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2796 variables, 6/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2796 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (OVERLAPS) 93/2889 variables, 36/1561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2889 variables, 9/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2889 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (OVERLAPS) 6/2895 variables, 3/1573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2895 variables, 6/1579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2895 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 93/2988 variables, 36/1615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2988 variables, 9/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2988 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 6/2994 variables, 3/1627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2994 variables, 6/1633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2994 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 93/3087 variables, 36/1669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3087 variables, 9/1678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3087 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 6/3093 variables, 3/1681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3093 variables, 6/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3093 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 93/3186 variables, 36/1723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3186 variables, 9/1732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3186 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 6/3192 variables, 3/1735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3192 variables, 6/1741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3192 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 89/3281 variables, 36/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3281 variables, 9/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3281 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 6/3287 variables, 3/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3287 variables, 6/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3287 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 31/3318 variables, 21/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3318 variables, 7/1823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/3318 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 0/3318 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3318/3318 variables, and 1823 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5185 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1409/1409 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 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
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 20/612 variables, 10/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 376/988 variables, 158/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/988 variables, 40/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/988 variables, 5/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/988 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 24/1012 variables, 12/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 24/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1012 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1012 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 256/1268 variables, 104/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1268 variables, 28/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1268 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1268 variables, 5/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1268 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1268 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 16/1284 variables, 8/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1284 variables, 16/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1284 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 228/1512 variables, 94/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1512 variables, 24/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1512 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1512 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1512 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 14/1526 variables, 7/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1526 variables, 14/824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1526 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 153/1679 variables, 66/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1679 variables, 18/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1679 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:21] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:23:21] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:23:21] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:23:21] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1679 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1679 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 8/1687 variables, 4/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1687 variables, 8/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1687 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 126/1813 variables, 50/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1813 variables, 13/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1813 variables, 2/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:21] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1813 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1813 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 8/1821 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1821 variables, 8/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1821 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 124/1945 variables, 48/1051 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1945 variables, 12/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:22] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:23:22] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1945 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1945 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 8/1953 variables, 4/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1953 variables, 8/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1953 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 124/2077 variables, 48/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2077 variables, 12/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:22] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:23:22] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/2077 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2077 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 8/2085 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2085 variables, 8/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2085 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 124/2209 variables, 48/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2209 variables, 12/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/2209 variables, 5/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
At refinement iteration 73 (INCLUDED_ONLY) 0/2209 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2209 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 8/2217 variables, 4/1221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2217 variables, 8/1229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2217 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 124/2341 variables, 48/1277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2341 variables, 12/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2341 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 8/2349 variables, 4/1293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2349 variables, 8/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2349 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 124/2473 variables, 48/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2473 variables, 12/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2473 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 8/2481 variables, 4/1365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2481 variables, 8/1373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2481 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 111/2592 variables, 48/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2592 variables, 13/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:25] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
At refinement iteration 92 (INCLUDED_ONLY) 0/2592 variables, 1/1435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:25] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/2592 variables, 1/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2592 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (OVERLAPS) 6/2598 variables, 3/1439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2598 variables, 6/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2598 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (OVERLAPS) 93/2691 variables, 36/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2691 variables, 9/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2691 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 6/2697 variables, 3/1493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2697 variables, 6/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2697 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 93/2790 variables, 36/1535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2790 variables, 9/1544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2790 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 6/2796 variables, 3/1547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2796 variables, 6/1553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2796 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 93/2889 variables, 36/1589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2889 variables, 9/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:26] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
At refinement iteration 112 (INCLUDED_ONLY) 0/2889 variables, 1/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2889 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 6/2895 variables, 3/1602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2895 variables, 6/1608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2895 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 93/2988 variables, 36/1644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/2988 variables, 9/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/2988 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 6/2994 variables, 3/1656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/2994 variables, 6/1662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/2994 variables, 0/1662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 93/3087 variables, 36/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3087 variables, 9/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:23:27] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:23:27] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
At refinement iteration 125 (INCLUDED_ONLY) 0/3087 variables, 2/1709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3087 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 6/3093 variables, 3/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3093 variables, 6/1718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3093 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (OVERLAPS) 93/3186 variables, 36/1754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3186 variables, 9/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/3186 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 6/3192 variables, 3/1766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/3192 variables, 6/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3192 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 89/3281 variables, 36/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3281 variables, 9/1817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/3281 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 6/3287 variables, 3/1820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3287 variables, 6/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/3287 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (OVERLAPS) 31/3318 variables, 21/1847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/3318 variables, 7/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/3318 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (OVERLAPS) 0/3318 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3318/3318 variables, and 1854 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9354 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1409/1409 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 41/41 constraints]
After SMT, in 14563ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3782 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 65 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 65 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 65 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-06-01 20:23:32] [INFO ] Invariant cache hit.
[2024-06-01 20:23:33] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-06-01 20:23:33] [INFO ] Invariant cache hit.
[2024-06-01 20:23:35] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2024-06-01 20:23:35] [INFO ] Redundant transitions in 266 ms returned []
Running 1904 sub problems to find dead transitions.
[2024-06-01 20:23:35] [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 30033 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-06-01 20:24:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:24:08] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1405 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:24:11] [INFO ] Deduced a trap composed of 6 places in 30 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-06-01 20:24:12] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:24:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:24:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:24:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:24:13] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:24:14] [INFO ] Deduced a trap composed of 6 places in 75 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-06-01 20:24:15] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1405 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 20:24:19] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 6 places in 59 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-06-01 20:24:23] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2024-06-01 20:24:23] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:24:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 9 places in 35 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-06-01 20:24:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:24:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:24:29] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:24:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:24:29] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:24:31] [INFO ] Deduced a trap composed of 21 places in 56 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-06-01 20:24:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:24:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 13 places in 59 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
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 30028 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 60817ms problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 60837ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63681 ms. Remains : 1409/1409 places, 1909/1909 transitions.
[2024-06-01 20:24:36] [INFO ] Flatten gal took : 129 ms
[2024-06-01 20:24:36] [INFO ] Flatten gal took : 136 ms
[2024-06-01 20:24:36] [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 13 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 4 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 662 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 662 ms. Remains : 1421/3350 places, 1921/3850 transitions.
[2024-06-01 20:24:37] [INFO ] Flatten gal took : 54 ms
[2024-06-01 20:24:37] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:24:38] [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 548 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 549 ms. Remains : 3310/3350 places, 3810/3850 transitions.
[2024-06-01 20:24:38] [INFO ] Flatten gal took : 100 ms
[2024-06-01 20:24:38] [INFO ] Flatten gal took : 95 ms
[2024-06-01 20:24:38] [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 523 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 524 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-06-01 20:24:39] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:24:39] [INFO ] Flatten gal took : 95 ms
[2024-06-01 20:24:39] [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 497 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 497 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-06-01 20:24:40] [INFO ] Flatten gal took : 99 ms
[2024-06-01 20:24:40] [INFO ] Flatten gal took : 99 ms
[2024-06-01 20:24:40] [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 491 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 493 ms. Remains : 3306/3350 places, 3806/3850 transitions.
[2024-06-01 20:24:41] [INFO ] Flatten gal took : 90 ms
[2024-06-01 20:24:41] [INFO ] Flatten gal took : 95 ms
[2024-06-01 20:24:41] [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 527 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 527 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-06-01 20:24:42] [INFO ] Flatten gal took : 94 ms
[2024-06-01 20:24:42] [INFO ] Flatten gal took : 101 ms
[2024-06-01 20:24:42] [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 519 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 519 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-06-01 20:24:43] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:24:43] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:24:43] [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 546 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 546 ms. Remains : 1406/3350 places, 1906/3850 transitions.
[2024-06-01 20:24:44] [INFO ] Flatten gal took : 45 ms
[2024-06-01 20:24:44] [INFO ] Flatten gal took : 51 ms
[2024-06-01 20:24:44] [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 488 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 489 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-06-01 20:24:45] [INFO ] Flatten gal took : 88 ms
[2024-06-01 20:24:45] [INFO ] Flatten gal took : 94 ms
[2024-06-01 20:24:45] [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 480 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 480 ms. Remains : 3306/3350 places, 3806/3850 transitions.
[2024-06-01 20:24:45] [INFO ] Flatten gal took : 87 ms
[2024-06-01 20:24:46] [INFO ] Flatten gal took : 95 ms
[2024-06-01 20:24:46] [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 568 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 569 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-06-01 20:24:46] [INFO ] Flatten gal took : 84 ms
[2024-06-01 20:24:47] [INFO ] Flatten gal took : 90 ms
[2024-06-01 20:24:47] [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 524 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 524 ms. Remains : 3305/3350 places, 3805/3850 transitions.
[2024-06-01 20:24:47] [INFO ] Flatten gal took : 84 ms
[2024-06-01 20:24:47] [INFO ] Flatten gal took : 90 ms
[2024-06-01 20:24:48] [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 10 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 8 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 5 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 536 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 536 ms. Remains : 1417/3350 places, 1917/3850 transitions.
[2024-06-01 20:24:48] [INFO ] Flatten gal took : 58 ms
[2024-06-01 20:24:48] [INFO ] Flatten gal took : 64 ms
[2024-06-01 20:24:48] [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 492 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 492 ms. Remains : 3303/3350 places, 3803/3850 transitions.
[2024-06-01 20:24:49] [INFO ] Flatten gal took : 86 ms
[2024-06-01 20:24:49] [INFO ] Flatten gal took : 93 ms
[2024-06-01 20:24:49] [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 8 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 5 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 569 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 569 ms. Remains : 1406/3350 places, 1906/3850 transitions.
[2024-06-01 20:24:50] [INFO ] Flatten gal took : 54 ms
[2024-06-01 20:24:50] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:24:50] [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 484 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 484 ms. Remains : 3304/3350 places, 3804/3850 transitions.
[2024-06-01 20:24:51] [INFO ] Flatten gal took : 85 ms
[2024-06-01 20:24:51] [INFO ] Flatten gal took : 91 ms
[2024-06-01 20:24:51] [INFO ] Input system was already deterministic with 3804 transitions.
[2024-06-01 20:24:51] [INFO ] Flatten gal took : 98 ms
[2024-06-01 20:24:51] [INFO ] Flatten gal took : 98 ms
[2024-06-01 20:24:51] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 20:24:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3350 places, 3850 transitions and 13094 arcs took 17 ms.
Total runtime 201462 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-100B-CTLFireability-2023-15

BK_STOP 1717273492242

--------------------
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
mcc2024
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1349/ctl_0_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1349/ctl_1_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1349/ctl_2_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1349/ctl_3_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1349/ctl_4_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1349/ctl_5_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1349/ctl_6_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1349/ctl_7_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1349/ctl_8_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1349/ctl_9_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1349/ctl_10_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1349/ctl_11_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1349/ctl_12_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1349/ctl_13_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1349/ctl_14_
ctl formula name ShieldRVs-PT-100B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1349/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
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 ltsminxred"
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 r528-tall-171683762000874"
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 ;