Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132000123.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 itstools
Input is Dekker-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132000123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-200-LTLCardinality-00
FORMULA_NAME Dekker-PT-200-LTLCardinality-01
FORMULA_NAME Dekker-PT-200-LTLCardinality-02
FORMULA_NAME Dekker-PT-200-LTLCardinality-03
FORMULA_NAME Dekker-PT-200-LTLCardinality-04
FORMULA_NAME Dekker-PT-200-LTLCardinality-05
FORMULA_NAME Dekker-PT-200-LTLCardinality-06
FORMULA_NAME Dekker-PT-200-LTLCardinality-07
FORMULA_NAME Dekker-PT-200-LTLCardinality-08
FORMULA_NAME Dekker-PT-200-LTLCardinality-09
FORMULA_NAME Dekker-PT-200-LTLCardinality-10
FORMULA_NAME Dekker-PT-200-LTLCardinality-11
FORMULA_NAME Dekker-PT-200-LTLCardinality-12
FORMULA_NAME Dekker-PT-200-LTLCardinality-13
FORMULA_NAME Dekker-PT-200-LTLCardinality-14
FORMULA_NAME Dekker-PT-200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716337069347

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:17:51] [INFO ] Load time of PNML (sax parser for PT used): 1025 ms
[2024-05-22 00:17:51] [INFO ] Transformed 1000 places.
[2024-05-22 00:17:51] [INFO ] Transformed 40400 transitions.
[2024-05-22 00:17:51] [INFO ] Found NUPN structural information;
[2024-05-22 00:17:51] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1154 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 00:17:53] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-22 00:17:53] [INFO ] Computed 600 invariants in 31 ms
[2024-05-22 00:18:23] [INFO ] Implicit Places using invariants in 30321 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 979, 982, 985, 988, 991, 994, 997]
Discarding 197 places :
Implicit Place search using SMT only with invariants took 30398 ms to find 197 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 803/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 789 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32367 ms. Remains : 803/1000 places, 40400/40400 transitions.
Support contains 26 out of 803 places after structural reductions.
[2024-05-22 00:18:26] [INFO ] Flatten gal took : 1618 ms
[2024-05-22 00:18:27] [INFO ] Flatten gal took : 1311 ms
[2024-05-22 00:18:30] [INFO ] Input system was already deterministic with 40400 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 3377 ms. (11 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
[2024-05-22 00:18:31] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-22 00:18:32] [INFO ] Computed 403 invariants in 4 ms
[2024-05-22 00:18:32] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 4 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/32 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 32/64 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 384/448 variables, 200/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 963/1411 variables, 579/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1411 variables, 579/1444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1411 variables, 189/1633 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1411 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 192/1603 variables, 195/1828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 192/2020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 3/2023 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 192/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1603 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 2215 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3623 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 8 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 7/32 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 32/64 variables, 32/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 384/448 variables, 200/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 963/1411 variables, 579/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1411 variables, 579/1448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1411 variables, 189/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1411 variables, 5/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1411 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 192/1603 variables, 195/1837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 192/2029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 3/2032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1603 variables, 192/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1603 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1603 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 2224 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3380 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 7377ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 20957 ms.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1029 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1032 ms. Remains : 803/803 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 2238 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264114 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264114 steps, saw 254098 distinct states, run finished after 3006 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-22 00:19:05] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 00:19:05] [INFO ] Invariant cache hit.
[2024-05-22 00:19:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 993/1405 variables, 597/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 597/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 195/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/1603 variables, 201/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 198/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 3/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 198/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 2210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1017 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 993/1405 variables, 597/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 597/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 195/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 1/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 1 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 1 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 1 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 1 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 4 places in 535 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 4 places in 553 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 1 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 0 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1405 variables, 20/1631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 1 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 0 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 1 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1405 variables, 20/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 1 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 1 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1405 variables, 20/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 1 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1405 variables, 20/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 0 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 0 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 0 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1405 variables, 20/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1405/1603 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45009 ms.
Refiners :[Domain max(s): 605/803 constraints, Positive P Invariants (semi-flows): 199/400 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 605/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 106/106 constraints]
After SMT, in 46266ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 987 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 987 ms. Remains : 803/803 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 976 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 00:19:53] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 00:19:53] [INFO ] Invariant cache hit.
[2024-05-22 00:19:59] [INFO ] Implicit Places using invariants in 6217 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6255 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 860 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8095 ms. Remains : 800/803 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 2680 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266124 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266124 steps, saw 256018 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-22 00:20:04] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 00:20:04] [INFO ] Computed 400 invariants in 11 ms
[2024-05-22 00:20:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 990/1402 variables, 594/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1402 variables, 594/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1402 variables, 198/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1402 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/1600 variables, 198/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 198/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 198/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1600 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1600 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 2201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 990/1402 variables, 594/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1402 variables, 594/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1402 variables, 198/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1402 variables, 1/1608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 4 places in 603 ms of which 1 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 1 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 4 places in 556 ms of which 1 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 4 places in 543 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 1 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 4 places in 527 ms of which 0 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 0 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 0 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 1 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1402 variables, 20/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 1 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 0 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 0 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 0 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 0 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 1 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 0 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1402 variables, 20/1648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-22 00:20:29] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2024-05-22 00:20:30] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-22 00:20:31] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1402 variables, 20/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 0 ms to minimize.
[2024-05-22 00:20:35] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2024-05-22 00:20:35] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 0 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 0 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1402 variables, 20/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2024-05-22 00:20:41] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2024-05-22 00:20:41] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-05-22 00:20:41] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-22 00:20:42] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-22 00:20:42] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-22 00:20:42] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-22 00:20:42] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-22 00:20:43] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-22 00:20:43] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-22 00:20:43] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2024-05-22 00:20:44] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-22 00:20:45] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-05-22 00:20:46] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1402 variables, 20/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-22 00:20:47] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2024-05-22 00:20:48] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-22 00:20:49] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-22 00:20:50] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-22 00:20:51] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-22 00:20:51] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-22 00:20:51] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-22 00:20:52] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-22 00:20:52] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-22 00:20:52] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 00:20:52] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1402 variables, 20/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-22 00:20:53] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-22 00:20:54] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1402 variables, 20/1748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1402 variables, 15/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1402 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 198/1600 variables, 198/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1600 variables, 198/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1600 variables, 198/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1600 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1600 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1600/1600 variables, and 2357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 57283 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 156/156 constraints]
After SMT, in 58490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2409 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 803 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 833 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 00:21:06] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 00:21:06] [INFO ] Invariant cache hit.
[2024-05-22 00:21:12] [INFO ] Implicit Places using invariants in 5924 ms returned []
Implicit Place search using SMT only with invariants took 5929 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2024-05-22 00:21:13] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 00:21:13] [INFO ] Invariant cache hit.
[2024-05-22 00:21:13] [INFO ] State equation strengthened by 200 read => feed constraints.

BK_STOP 1716337356331

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Dekker-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132000123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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