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.r488-tall-171631132900566.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 DoubleExponent-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717195498179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:44:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:44:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:44:59] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-31 22:44:59] [INFO ] Transformed 1064 places.
[2024-05-31 22:44:59] [INFO ] Transformed 998 transitions.
[2024-05-31 22:44:59] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1314 resets) in 1597 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (122 resets) in 148 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (108 resets) in 86 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (106 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (102 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 115553 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 16
Probabilistic random walk after 115553 steps, saw 57790 distinct states, run finished after 3008 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 998 rows 1064 cols
[2024-05-31 22:45:03] [INFO ] Invariants computation overflowed in 129 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 543/802 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 987/1789 variables, 573/832 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1789 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 265/2054 variables, 225/1057 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2062 variables, and 1057 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5059 ms.
Refiners :[State Equation: 1057/1064 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 482/709 variables, 227/227 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 975/1684 variables, 531/759 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1684 variables, 14/773 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1684 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2042/2062 variables, and 1060 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5015 ms.
Refiners :[State Equation: 1045/1064 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10318ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 227 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1057 transition count 906
Reduce places removed 90 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 131 rules applied. Total rules applied 225 place count 967 transition count 865
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 266 place count 926 transition count 865
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 266 place count 926 transition count 831
Deduced a syphon composed of 34 places in 16 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 334 place count 892 transition count 831
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 7 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 508 place count 805 transition count 744
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 20 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 528 place count 795 transition count 744
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 535 place count 795 transition count 737
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 542 place count 788 transition count 737
Free-agglomeration rule (complex) applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 613 place count 788 transition count 666
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 684 place count 717 transition count 666
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 732 place count 717 transition count 666
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 733 place count 717 transition count 666
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 734 place count 716 transition count 665
Applied a total of 734 rules in 446 ms. Remains 716 /1064 variables (removed 348) and now considering 665/998 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 716/1064 places, 665/998 transitions.
RANDOM walk for 40000 steps (1715 resets) in 541 ms. (73 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (136 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (143 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (146 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (140 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (141 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (141 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (138 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (142 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (143 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (134 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (137 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (134 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (138 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (141 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (141 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 152520 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 15
Probabilistic random walk after 152520 steps, saw 76302 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 665 rows 716 cols
[2024-05-31 22:45:18] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 22:45:18] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 532/759 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 9/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/759 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 594/1353 variables, 461/697 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1353 variables, 25/722 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1353 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-020-ReachabilityCardinality-2024-11 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 28/1381 variables, 28/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1381 variables, 0/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1381 variables, 0/750 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1381/1381 variables, and 750 constraints, problems are : Problem set: 3 solved, 12 unsolved in 14031 ms.
Refiners :[State Equation: 716/716 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/534 variables, 152/152 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 5/157 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 707/1241 variables, 442/599 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 26/625 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 12/637 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 0/637 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 139/1380 variables, 121/758 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1380 variables, 3/761 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 23 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 4 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 173 places in 135 ms of which 2 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 191 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 180 places in 114 ms of which 3 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 3 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 198 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 187 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 166 places in 111 ms of which 3 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:45:57] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:45:57] [INFO ] Deduced a trap composed of 127 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1380 variables, 17/778 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1380 variables, 0/778 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/1381 variables, 1/779 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1381/1381 variables, and 779 constraints, problems are : Problem set: 3 solved, 12 unsolved in 45018 ms.
Refiners :[State Equation: 716/716 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 17/17 constraints]
After SMT, in 59177ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 665/665 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 716 transition count 658
Reduce places removed 7 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 709 transition count 651
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 28 place count 702 transition count 651
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 28 place count 702 transition count 645
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 696 transition count 645
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 94 place count 669 transition count 618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 668 transition count 618
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 668 transition count 615
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 665 transition count 615
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 122 place count 665 transition count 595
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 142 place count 645 transition count 595
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 159 place count 645 transition count 595
Applied a total of 159 rules in 114 ms. Remains 645 /716 variables (removed 71) and now considering 595/665 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 645/716 places, 595/665 transitions.
RANDOM walk for 40000 steps (1835 resets) in 330 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1489 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1504 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1489 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1489 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1474 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1509 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1505 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1518 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (2048 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1488 resets) in 261 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1520 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1510 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 161923 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 12
Probabilistic random walk after 161923 steps, saw 80997 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 595 rows 645 cols
[2024-05-31 22:46:21] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 22:46:21] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 399/551 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 617/1168 variables, 427/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 32/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1168 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 72/1240 variables, 66/684 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1240 variables, 3/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1240 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 687 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8953 ms.
Refiners :[State Equation: 645/645 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 399/551 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 617/1168 variables, 427/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 32/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1168 variables, 12/630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1168 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/1240 variables, 66/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 22:47:32] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 4 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 4 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 3 ms to minimize.
[2024-05-31 22:47:37] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 20/719 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 719 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75019 ms.
Refiners :[State Equation: 645/645 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 84039ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 595/595 transitions.
Applied a total of 0 rules in 17 ms. Remains 645 /645 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 645/645 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 645 /645 variables (removed 0) and now considering 595/595 (removed 0) transitions.
// Phase 1: matrix 595 rows 645 cols
[2024-05-31 22:47:45] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:47:45] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 595 rows 645 cols
[2024-05-31 22:47:45] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 22:47:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:47:54] [INFO ] Implicit Places using invariants and state equation in 8686 ms returned [17, 25, 58, 67, 97, 107, 209, 210, 279, 288, 298, 327, 368, 392, 399, 426, 435, 528, 530, 536, 559, 567, 598, 605]
[2024-05-31 22:47:54] [INFO ] Actually due to overlaps returned [288, 536, 67, 279, 298, 528, 17, 58, 209, 210]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 9016 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 635/645 places, 595/595 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 634 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 634 transition count 594
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 634 transition count 594
Applied a total of 5 rules in 78 ms. Remains 634 /635 variables (removed 1) and now considering 594/595 (removed 1) transitions.
// Phase 1: matrix 594 rows 634 cols
[2024-05-31 22:47:54] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 22:47:54] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 594 rows 634 cols
[2024-05-31 22:47:54] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 22:47:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:48:03] [INFO ] Implicit Places using invariants and state equation in 8602 ms returned [93, 103, 318, 359, 383, 390, 417, 426, 520, 548, 556, 587, 594]
[2024-05-31 22:48:03] [INFO ] Actually due to overlaps returned [318, 556, 93, 103, 520, 548]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 8853 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 628/645 places, 594/595 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 628 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 627 transition count 593
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 627 transition count 593
Applied a total of 4 rules in 53 ms. Remains 627 /628 variables (removed 1) and now considering 593/594 (removed 1) transitions.
// Phase 1: matrix 593 rows 627 cols
[2024-05-31 22:48:03] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 22:48:03] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 593 rows 627 cols
[2024-05-31 22:48:03] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 22:48:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:48:10] [INFO ] Implicit Places using invariants and state equation in 6695 ms returned [356, 380, 387, 414, 423, 580, 587]
[2024-05-31 22:48:10] [INFO ] Actually due to overlaps returned [356, 587, 580]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 6948 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 624/645 places, 593/595 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 592
Applied a total of 2 rules in 30 ms. Remains 623 /624 variables (removed 1) and now considering 592/593 (removed 1) transitions.
// Phase 1: matrix 592 rows 623 cols
[2024-05-31 22:48:10] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 22:48:10] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 592 rows 623 cols
[2024-05-31 22:48:10] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 22:48:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:48:17] [INFO ] Implicit Places using invariants and state equation in 6766 ms returned [379, 386, 413, 422]
[2024-05-31 22:48:17] [INFO ] Actually due to overlaps returned [386, 379]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7017 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 621/645 places, 592/595 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 621 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 620 transition count 591
Applied a total of 2 rules in 31 ms. Remains 620 /621 variables (removed 1) and now considering 591/592 (removed 1) transitions.
// Phase 1: matrix 591 rows 620 cols
[2024-05-31 22:48:17] [INFO ] Computed 79 invariants in 101 ms
[2024-05-31 22:48:17] [INFO ] Implicit Places using invariants in 457 ms returned [410, 419]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 458 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 618/645 places, 591/595 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 618 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 617 transition count 590
Applied a total of 2 rules in 30 ms. Remains 617 /618 variables (removed 1) and now considering 590/591 (removed 1) transitions.
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:48:17] [INFO ] Invariants computation overflowed in 128 ms
[2024-05-31 22:48:18] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:48:18] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-31 22:48:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:48:27] [INFO ] Implicit Places using invariants and state equation in 8953 ms returned []
Implicit Place search using SMT with State Equation took 9277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 617/645 places, 590/595 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 41808 ms. Remains : 617/645 places, 590/595 transitions.
RANDOM walk for 40000 steps (1852 resets) in 421 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1506 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1509 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1492 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1521 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1503 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1512 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1522 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1496 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (2052 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1514 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1469 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1478 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 128557 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 12
Probabilistic random walk after 128557 steps, saw 64290 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:48:30] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-31 22:48:30] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 402/554 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 590/1144 variables, 408/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 32/599 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 63/1207 variables, 57/656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1207 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1207 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1207 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1207/1207 variables, and 659 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7591 ms.
Refiners :[State Equation: 617/617 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 402/554 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 590/1144 variables, 408/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 32/599 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 12/611 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 63/1207 variables, 57/668 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1207 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 4 ms to minimize.
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 232 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:50:01] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 4 ms to minimize.
[2024-05-31 22:50:01] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 4 ms to minimize.
[2024-05-31 22:50:01] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:50:01] [INFO ] Deduced a trap composed of 234 places in 189 ms of which 4 ms to minimize.
[2024-05-31 22:50:02] [INFO ] Deduced a trap composed of 237 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:50:02] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 4 ms to minimize.
[2024-05-31 22:50:02] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 188 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 190 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:50:05] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:50:05] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 4 ms to minimize.
[2024-05-31 22:50:05] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 7 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 194 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 197 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:50:07] [INFO ] Deduced a trap composed of 213 places in 179 ms of which 4 ms to minimize.
[2024-05-31 22:50:07] [INFO ] Deduced a trap composed of 201 places in 183 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1207 variables, 20/691 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1207 variables, and 691 constraints, problems are : Problem set: 0 solved, 12 unsolved in 90034 ms.
Refiners :[State Equation: 617/617 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 97744ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 152 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 590/590 transitions.
Applied a total of 0 rules in 23 ms. Remains 617 /617 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 617/617 places, 590/590 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 617 /617 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:50:08] [INFO ] Invariants computation overflowed in 79 ms
[2024-05-31 22:50:08] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:50:08] [INFO ] Invariants computation overflowed in 79 ms
[2024-05-31 22:50:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 22:50:17] [INFO ] Implicit Places using invariants and state equation in 8981 ms returned []
Implicit Place search using SMT with State Equation took 9281 ms to find 0 implicit places.
[2024-05-31 22:50:17] [INFO ] Redundant transitions in 33 ms returned []
Running 589 sub problems to find dead transitions.
// Phase 1: matrix 590 rows 617 cols
[2024-05-31 22:50:18] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-31 22:50:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 590/1206 variables, 616/616 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1206 variables, 42/658 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 589 unsolved
SMT process timed out in 30252ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 30261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39603 ms. Remains : 617/617 places, 590/590 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 617 transition count 582
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 609 transition count 582
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 609 transition count 574
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 601 transition count 574
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 601 transition count 568
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 595 transition count 568
Applied a total of 44 rules in 34 ms. Remains 595 /617 variables (removed 22) and now considering 568/590 (removed 22) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 568 rows 595 cols
[2024-05-31 22:50:48] [INFO ] Computed 77 invariants in 93 ms
[2024-05-31 22:50:48] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-31 22:50:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-31 22:50:48] [INFO ] [Nat]Absence check using 2 positive and 75 generalized place invariants in 34 ms returned sat
[2024-05-31 22:51:05] [INFO ] After 16114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-31 22:51:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 22:51:24] [INFO ] After 19030ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 4 ms to minimize.
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:51:26] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:51:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1808 ms
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:51:28] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:51:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1576 ms
[2024-05-31 22:51:30] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-31 22:51:30] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:51:30] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:51:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 223 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 221 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 219 places in 179 ms of which 4 ms to minimize.
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 241 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 239 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 231 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 233 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:51:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2469 ms
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 228 places in 182 ms of which 4 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 203 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 189 places in 193 ms of which 3 ms to minimize.
[2024-05-31 22:51:34] [INFO ] Deduced a trap composed of 186 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:51:35] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2024-05-31 22:51:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1259 ms
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-31 22:51:43] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:51:44] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:51:45] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:51:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2707 ms
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 3 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:51:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 732 ms
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-31 22:51:56] [INFO ] Deduced a trap composed of 194 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:51:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 197 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 222 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:51:57] [INFO ] Deduced a trap composed of 235 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:51:58] [INFO ] Deduced a trap composed of 217 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:51:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1019 ms
TRAPS : Iteration 1
[2024-05-31 22:52:00] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 189 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:52:01] [INFO ] Deduced a trap composed of 200 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 211 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 202 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 237 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 231 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:52:02] [INFO ] Deduced a trap composed of 214 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:52:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1847 ms
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 190 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 223 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 195 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:52:04] [INFO ] Deduced a trap composed of 217 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 213 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 202 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 193 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:52:05] [INFO ] Deduced a trap composed of 207 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 197 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 197 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 198 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:52:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2345 ms
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2024-05-31 22:52:18] [INFO ] Deduced a trap composed of 149 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:52:18] [INFO ] Deduced a trap composed of 142 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2024-05-31 22:52:22] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
TRAPS : Iteration 2
[2024-05-31 22:52:30] [INFO ] Deduced a trap composed of 219 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 239 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 227 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 226 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 262 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:52:31] [INFO ] Deduced a trap composed of 231 places in 155 ms of which 4 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 245 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 238 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 226 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 236 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 249 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 209 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:52:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2557 ms
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 217 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 211 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 196 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 231 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:52:34] [INFO ] Deduced a trap composed of 193 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 211 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1463 ms
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 237 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 221 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:52:35] [INFO ] Deduced a trap composed of 220 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 244 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 232 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 219 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 232 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:52:36] [INFO ] Deduced a trap composed of 231 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 239 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 229 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 233 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:52:37] [INFO ] Deduced a trap composed of 227 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 225 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 229 places in 163 ms of which 4 ms to minimize.
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 217 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 212 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:52:38] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:52:39] [INFO ] Deduced a trap composed of 172 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:52:39] [INFO ] Deduced a trap composed of 227 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:52:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3995 ms
[2024-05-31 22:53:02] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:53:11] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:53:12] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:53:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9587 ms
[2024-05-31 22:53:33] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:53:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 211 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 225 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 204 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 212 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 198 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 217 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 215 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 225 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 222 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1944 ms
TRAPS : Iteration 3
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 211 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 223 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 4 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 209 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 192 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 232 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 218 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 242 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 236 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 232 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 216 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 207 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 221 places in 160 ms of which 4 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 218 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 224 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 197 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 226 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 203 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 215 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 198 places in 179 ms of which 4 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 189 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 195 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 192 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 186 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 196 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 209 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 199 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:53:45] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:53:45] [INFO ] Deduced a trap composed of 198 places in 192 ms of which 3 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 200 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 218 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 202 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 201 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 204 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 219 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 208 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 205 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 210 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 203 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 191 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 196 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 203 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 209 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 217 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 208 places in 185 ms of which 4 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 207 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 203 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 209 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 208 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 205 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 214 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 224 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 202 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 204 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 192 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 207 places in 201 ms of which 7 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 197 places in 185 ms of which 4 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 194 places in 176 ms of which 4 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 197 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 193 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:53:55] [INFO ] Deduced a trap composed of 216 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:53:55] [INFO ] Deduced a trap composed of 207 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:53:55] [INFO ] Deduced a trap composed of 216 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:53:55] [INFO ] Deduced a trap composed of 196 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 208 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 215 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 187 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 206 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 214 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 205 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 212 places in 171 ms of which 4 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 212 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 207 places in 164 ms of which 4 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 223 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 215 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 213 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 208 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 194 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 212 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 209 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 212 places in 181 ms of which 4 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 212 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 214 places in 182 ms of which 4 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 207 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 237 places in 182 ms of which 4 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 235 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 236 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 226 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 228 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 214 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 216 places in 179 ms of which 4 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 219 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 221 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 204 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 197 places in 183 ms of which 4 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 203 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 227 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 221 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 207 places in 187 ms of which 4 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 208 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 235 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 210 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 217 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 198 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 207 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 189 places in 191 ms of which 4 ms to minimize.
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 216 places in 192 ms of which 4 ms to minimize.
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 211 places in 182 ms of which 4 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 212 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 210 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 218 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:54:11] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:54:11] [INFO ] Deduced a trap composed of 195 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:54:11] [INFO ] Deduced a trap composed of 194 places in 190 ms of which 3 ms to minimize.
[2024-05-31 22:54:11] [INFO ] Deduced a trap composed of 190 places in 187 ms of which 3 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 215 places in 197 ms of which 4 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 237 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 211 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 214 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 194 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 191 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 206 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 226 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 205 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 210 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 219 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 215 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 212 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 192 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 214 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 205 places in 165 ms of which 4 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 212 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 201 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 234 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 235 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 234 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:17] [INFO ] Deduced a trap composed of 246 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:17] [INFO ] Deduced a trap composed of 220 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:18] [INFO ] Deduced a trap composed of 196 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:18] [INFO ] Deduced a trap composed of 215 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:18] [INFO ] Deduced a trap composed of 189 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 191 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 204 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 223 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 214 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 214 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:20] [INFO ] Deduced a trap composed of 207 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:20] [INFO ] Deduced a trap composed of 210 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:20] [INFO ] Deduced a trap composed of 215 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 214 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 218 places in 175 ms of which 4 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 204 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 225 places in 166 ms of which 4 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 219 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 229 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 206 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 231 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:54:23] [INFO ] Deduced a trap composed of 225 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:23] [INFO ] Deduced a trap composed of 204 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:23] [INFO ] Deduced a trap composed of 206 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 206 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 193 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Trap strengthening (SAT) tested/added 173/172 trap constraints in 48823 ms
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 232 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 219 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 223 places in 186 ms of which 4 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 220 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 223 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 220 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 223 places in 193 ms of which 5 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 217 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 214 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 228 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 210 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 216 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 176 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 204 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 215 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 234 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 229 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 207 places in 176 ms of which 4 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 226 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 217 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 218 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 187 places in 171 ms of which 4 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 223 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 216 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 203 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 209 places in 178 ms of which 4 ms to minimize.
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 224 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 212 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:38] [INFO ] Deduced a trap composed of 215 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:38] [INFO ] Deduced a trap composed of 220 places in 176 ms of which 4 ms to minimize.
[2024-05-31 22:54:38] [INFO ] Deduced a trap composed of 225 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:38] [INFO ] Deduced a trap composed of 231 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 206 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 187 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 227 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 250 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 182 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 8354 ms
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 224 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 213 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 223 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 224 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 239 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 212 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 198 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 241 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 219 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 227 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 216 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 209 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 212 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 201 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 216 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 217 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 227 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 220 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 229 places in 176 ms of which 4 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 222 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 226 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 213 places in 179 ms of which 4 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 212 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 150 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 239 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 230 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 235 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 231 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 209 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 216 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 202 places in 184 ms of which 3 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 201 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 208 places in 176 ms of which 6 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 227 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 207 places in 176 ms of which 4 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 213 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 203 places in 201 ms of which 3 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 209 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 174 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 179 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 185 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 213 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 214 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 201 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 184 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 232 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 207 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 4 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 216 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 214 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 236 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 218 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 233 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 231 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 230 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 219 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 214 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 228 places in 166 ms of which 4 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 233 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 216 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 174 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 228 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 252 places in 164 ms of which 4 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 257 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 246 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 217 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 259 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 214 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 222 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 180 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 250 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 233 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 209 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 215 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 221 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 225 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 203 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 202 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 225 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 249 places in 178 ms of which 3 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 213 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 227 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 227 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 229 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 217 places in 171 ms of which 4 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 220 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 221 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 4 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 219 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 236 places in 174 ms of which 3 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 226 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 183 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 228 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 223 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 218 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 229 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 223 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 220 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 219 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 215 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 205 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 183 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 225 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 233 places in 171 ms of which 3 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 249 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 242 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 203 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 216 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 224 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 183 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 218 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 212 places in 173 ms of which 4 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 220 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 214 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 203 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 220 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 213 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 213 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 214 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 226 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 226 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 217 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 201 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 221 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 228 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 216 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 220 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 224 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 225 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 201 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 230 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 223 places in 172 ms of which 3 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 224 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 231 places in 169 ms of which 4 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 218 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 237 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Trap strengthening (SAT) tested/added 164/163 trap constraints in 35296 ms
[2024-05-31 22:56:08] [INFO ] Deduced a trap composed of 156 places in 126 ms of which 2 ms to minimize.
[2024-05-31 22:56:08] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:56:08] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:56:09] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:56:09] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:56:09] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 2 ms to minimize.
[2024-05-31 22:56:09] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 2 ms to minimize.
[2024-05-31 22:56:09] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:56:10] [INFO ] Deduced a trap composed of 152 places in 125 ms of which 2 ms to minimize.
[2024-05-31 22:56:17] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 150 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 152 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 1 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 10364 ms
[2024-05-31 22:56:42] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 3 ms to minimize.
[2024-05-31 22:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-05-31 22:56:43] [INFO ] Deduced a trap composed of 192 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 217 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 221 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 208 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 210 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 205 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 205 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 216 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 228 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 244 places in 167 ms of which 3 ms to minimize.
[2024-05-31 22:56:46] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 4 ms to minimize.
[2024-05-31 22:56:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2578 ms
TRAPS : Iteration 4
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4225 ms
[2024-05-31 22:57:23] [INFO ] Deduced a trap composed of 201 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:57:23] [INFO ] Deduced a trap composed of 206 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:57:23] [INFO ] Deduced a trap composed of 211 places in 176 ms of which 3 ms to minimize.
[2024-05-31 22:57:24] [INFO ] Deduced a trap composed of 193 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:57:24] [INFO ] Deduced a trap composed of 171 places in 188 ms of which 3 ms to minimize.
[2024-05-31 22:57:24] [INFO ] Deduced a trap composed of 180 places in 183 ms of which 3 ms to minimize.
[2024-05-31 22:57:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1472 ms
[2024-05-31 22:57:35] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1309 ms
[2024-05-31 22:57:56] [INFO ] Deduced a trap composed of 211 places in 168 ms of which 3 ms to minimize.
[2024-05-31 22:57:56] [INFO ] Deduced a trap composed of 217 places in 166 ms of which 4 ms to minimize.
[2024-05-31 22:57:56] [INFO ] Deduced a trap composed of 200 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:57:56] [INFO ] Deduced a trap composed of 221 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 191 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 226 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 220 places in 173 ms of which 3 ms to minimize.
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 209 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 235 places in 169 ms of which 3 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 194 places in 186 ms of which 3 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 191 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 214 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 213 places in 162 ms of which 4 ms to minimize.
[2024-05-31 22:57:59] [INFO ] Deduced a trap composed of 211 places in 160 ms of which 4 ms to minimize.
[2024-05-31 22:57:59] [INFO ] Deduced a trap composed of 198 places in 159 ms of which 4 ms to minimize.
[2024-05-31 22:57:59] [INFO ] Deduced a trap composed of 202 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:57:59] [INFO ] Deduced a trap composed of 224 places in 168 ms of which 4 ms to minimize.
[2024-05-31 22:57:59] [INFO ] Deduced a trap composed of 250 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:58:00] [INFO ] Deduced a trap composed of 253 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:58:00] [INFO ] Deduced a trap composed of 249 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:58:00] [INFO ] Deduced a trap composed of 216 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:58:00] [INFO ] Deduced a trap composed of 255 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:58:00] [INFO ] Deduced a trap composed of 152 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:58:01] [INFO ] Deduced a trap composed of 240 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:58:01] [INFO ] Deduced a trap composed of 264 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:58:01] [INFO ] Deduced a trap composed of 224 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:58:01] [INFO ] Deduced a trap composed of 221 places in 165 ms of which 4 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 226 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 229 places in 156 ms of which 4 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 200 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 231 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 207 places in 166 ms of which 3 ms to minimize.
[2024-05-31 22:58:03] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 3 ms to minimize.
[2024-05-31 22:58:03] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 3 ms to minimize.
[2024-05-31 22:58:03] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:58:04] [INFO ] Deduced a trap composed of 223 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:58:04] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-31 22:58:04] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 4 ms to minimize.
[2024-05-31 22:58:04] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 3 ms to minimize.
[2024-05-31 22:58:04] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 8799 ms
TRAPS : Iteration 5
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 224 places in 177 ms of which 4 ms to minimize.
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 3 ms to minimize.
SMT process timed out, exceeded limit of 225
[2024-05-31 22:58:18] [INFO ] After 433762ms SMT Verify possible using After timeout in natural domain returned unsat :1 sat :10
[2024-05-31 22:58:18] [INFO ] After 450228ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-2024-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 450589 ms.
[2024-05-31 22:58:18] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-31 22:58:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 617 places, 590 transitions and 2291 arcs took 9 ms.
[2024-05-31 22:58:19] [INFO ] Flatten gal took : 77 ms
Total runtime 799707 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 : DoubleExponent-PT-020-ReachabilityCardinality-2024-00
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-01
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-05
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-06
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-07
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2023-08
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2023-09
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2024-10
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2023-14
Could not compute solution for formula : DoubleExponent-PT-020-ReachabilityCardinality-2023-15

BK_STOP 1717196299417

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_0_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_1_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_2_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_3_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_4_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/2554/inv_5_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/2554/inv_6_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2023-09
rfs formula type AG
rfs formula formula --invariant=/tmp/2554/inv_7_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_8_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2023-14
rfs formula type EF
rfs formula formula --invariant=/tmp/2554/inv_9_
rfs formula name DoubleExponent-PT-020-ReachabilityCardinality-2023-15
rfs formula type AG
rfs formula formula --invariant=/tmp/2554/inv_10_
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="DoubleExponent-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
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 DoubleExponent-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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