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.r504-tall-171649612500303.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 LamportFastMutEx-PT-7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612500303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 20K Apr 13 07:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 13 07:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 13 07:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 199K Apr 13 07:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 13 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 13 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 265K 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 LamportFastMutEx-PT-7-ReachabilityFireability-2024-00
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-01
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-02
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-03
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-04
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-05
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-06
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-07
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-08
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-09
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-10
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-11
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-12
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-13
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-14
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717227689190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:41:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:41:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:41:30] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-01 07:41:30] [INFO ] Transformed 264 places.
[2024-06-01 07:41:30] [INFO ] Transformed 536 transitions.
[2024-06-01 07:41:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:41:30] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2024-06-01 07:41:30] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1240 ms. (32 steps per ms) remains 4/13 properties
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 1474 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1285 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/4 properties
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 07:41:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2024-06-01 07:41:32] [INFO ] Computed 65 invariants in 19 ms
[2024-06-01 07:41:32] [INFO ] State equation strengthened by 91 read => feed constraints.
Problem LamportFastMutEx-PT-7-ReachabilityFireability-2024-05 is UNSAT
FORMULA LamportFastMutEx-PT-7-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 65/284 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 336/555 variables, 219/503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 91/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 9 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/555 variables, 2/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 596 constraints, problems are : Problem set: 1 solved, 2 unsolved in 831 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 4 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 10/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 336/555 variables, 219/515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 91/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 2/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 13/621 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 1/622 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/622 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 622 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5007 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 6552ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 22 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 219/219 places, 462/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1909 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 418341 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 2
Probabilistic random walk after 418341 steps, saw 196854 distinct states, run finished after 3005 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 07:41:42] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:41:42] [INFO ] Invariant cache hit.
[2024-06-01 07:41:42] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:41:42] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 336/555 variables, 219/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 91/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 596 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 5 ms to minimize.
[2024-06-01 07:41:43] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 10/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:41:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 336/555 variables, 219/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 91/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 612 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3076 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 3932ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 351 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 219/219 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-06-01 07:41:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:41:46] [INFO ] Invariant cache hit.
[2024-06-01 07:41:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 07:41:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:41:46] [INFO ] Invariant cache hit.
[2024-06-01 07:41:46] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 07:41:46] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-01 07:41:46] [INFO ] Redundant transitions in 26 ms returned []
Running 455 sub problems to find dead transitions.
[2024-06-01 07:41:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:41:47] [INFO ] Invariant cache hit.
[2024-06-01 07:41:47] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 65/284 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 8 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/304 constraints. Problems are: Problem set: 8 solved, 447 unsolved
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/324 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/344 constraints. Problems are: Problem set: 17 solved, 438 unsolved
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/364 constraints. Problems are: Problem set: 22 solved, 433 unsolved
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 3 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/384 constraints. Problems are: Problem set: 24 solved, 431 unsolved
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/404 constraints. Problems are: Problem set: 30 solved, 425 unsolved
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/424 constraints. Problems are: Problem set: 32 solved, 423 unsolved
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/444 constraints. Problems are: Problem set: 34 solved, 421 unsolved
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/464 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/484 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/504 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:42:17] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:42:17] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 36 solved, 419 unsolved
Search for dead transitions found 36 dead transitions in 30312ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/219 places, 426/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-01 07:42:17] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30672 ms. Remains : 219/219 places, 426/462 transitions.
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1304 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 536892 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 2
Probabilistic random walk after 536892 steps, saw 248173 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2024-06-01 07:42:20] [INFO ] Flow matrix only has 311 transitions (discarded 115 similar events)
// Phase 1: matrix 311 rows 219 cols
[2024-06-01 07:42:20] [INFO ] Computed 65 invariants in 2 ms
[2024-06-01 07:42:20] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 311/530 variables, 219/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 87/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 3 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:22] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 9/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 311/530 variables, 219/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 87/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:42:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:42:23] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/530 variables, 5/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/530 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 609 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4462 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 5039ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 960 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 219/219 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-01 07:42:26] [INFO ] Flow matrix only has 311 transitions (discarded 115 similar events)
[2024-06-01 07:42:26] [INFO ] Invariant cache hit.
[2024-06-01 07:42:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 07:42:26] [INFO ] Flow matrix only has 311 transitions (discarded 115 similar events)
[2024-06-01 07:42:26] [INFO ] Invariant cache hit.
[2024-06-01 07:42:27] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 07:42:27] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-01 07:42:27] [INFO ] Redundant transitions in 3 ms returned []
Running 419 sub problems to find dead transitions.
[2024-06-01 07:42:27] [INFO ] Flow matrix only has 311 transitions (discarded 115 similar events)
[2024-06-01 07:42:27] [INFO ] Invariant cache hit.
[2024-06-01 07:42:27] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 9/221 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/277 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/530 variables, and 504 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30017 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/87 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 9/221 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 144/365 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 56/421 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 7/428 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 76/504 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 5 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:43:01] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/524 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/544 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:43:06] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/564 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:43:07] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD85 is UNSAT
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/584 constraints. Problems are: Problem set: 4 solved, 415 unsolved
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/604 constraints. Problems are: Problem set: 4 solved, 415 unsolved
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/624 constraints. Problems are: Problem set: 4 solved, 415 unsolved
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/644 constraints. Problems are: Problem set: 6 solved, 413 unsolved
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/664 constraints. Problems are: Problem set: 6 solved, 413 unsolved
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:20] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/684 constraints. Problems are: Problem set: 6 solved, 413 unsolved
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 20/704 constraints. Problems are: Problem set: 6 solved, 413 unsolved
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:27] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
SMT process timed out in 60195ms, After SMT, problems are : Problem set: 6 solved, 413 unsolved
Search for dead transitions found 6 dead transitions in 60201ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/219 places, 420/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 07:43:27] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60462 ms. Remains : 219/219 places, 420/426 transitions.
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2112 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 523671 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 2
Probabilistic random walk after 523671 steps, saw 242264 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-06-01 07:43:31] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-06-01 07:43:31] [INFO ] Computed 65 invariants in 2 ms
[2024-06-01 07:43:31] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/527 variables, 219/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 84/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/527 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 589 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/219 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:43:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:32] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:43:32] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:32] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 9/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 308/527 variables, 219/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 84/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/527 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2538 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 3124ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 796 ms.
Support contains 198 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 219/219 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 07:43:34] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:43:34] [INFO ] Invariant cache hit.
[2024-06-01 07:43:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:43:35] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:43:35] [INFO ] Invariant cache hit.
[2024-06-01 07:43:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-01 07:43:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-06-01 07:43:35] [INFO ] Redundant transitions in 2 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-01 07:43:35] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-06-01 07:43:35] [INFO ] Invariant cache hit.
[2024-06-01 07:43:35] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 9/221 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/277 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:51] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 3 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30441 ms. Remains : 219/219 places, 420/420 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 219 transition count 308
Applied a total of 112 rules in 15 ms. Remains 219 /219 variables (removed 0) and now considering 308/420 (removed 112) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:44:05] [INFO ] Invariant cache hit.
[2024-06-01 07:44:05] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:44:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2024-06-01 07:44:06] [INFO ] After 911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:44:07] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
TRAPS : Iteration 1
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 441 ms
TRAPS : Iteration 2
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 3
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 4
[2024-06-01 07:44:11] [INFO ] After 5764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:44:12] [INFO ] After 6685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 6928 ms.
[2024-06-01 07:44:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 07:44:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 420 transitions and 1848 arcs took 5 ms.
[2024-06-01 07:44:12] [INFO ] Flatten gal took : 64 ms
Total runtime 162233 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 : LamportFastMutEx-PT-7-ReachabilityFireability-2024-04
Could not compute solution for formula : LamportFastMutEx-PT-7-ReachabilityFireability-2024-09

BK_STOP 1717227852831

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name LamportFastMutEx-PT-7-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/3449/inv_0_
rfs formula name LamportFastMutEx-PT-7-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/3449/inv_1_
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="LamportFastMutEx-PT-7"
export BK_EXAMINATION="ReachabilityFireability"
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 LamportFastMutEx-PT-7, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612500303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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