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.r224-tall-171649612500295.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612500295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 15K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 13 07:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 253K Apr 13 07:42 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 8.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 382K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K 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 208K 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-6-ReachabilityFireability-2024-00
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-01
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-02
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-03
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-04
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-05
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-06
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-07
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-08
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-09
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-10
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-11
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-12
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-13
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-14
FORMULA_NAME LamportFastMutEx-PT-6-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716572072146

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 17:34:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 17:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:34:33] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 17:34:33] [INFO ] Transformed 217 places.
[2024-05-24 17:34:33] [INFO ] Transformed 420 transitions.
[2024-05-24 17:34:33] [INFO ] Found NUPN structural information;
[2024-05-24 17:34:33] [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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, 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_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]
[2024-05-24 17:34:33] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1668 ms. (23 steps per ms) remains 6/15 properties
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 17:34:34] [INFO ] Flatten gal took : 142 ms
[2024-05-24 17:34:34] [INFO ] Flatten gal took : 65 ms
[2024-05-24 17:34:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13362671940171705240.gal : 34 ms
[2024-05-24 17:34:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14227046083912695302.prop : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13362671940171705240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14227046083912695302.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14227046083912695302.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 24
BEST_FIRST walk for 40004 steps (8 resets) in 2139 ms. (18 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :24 after 35
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :35 after 48
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :48 after 148
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :148 after 442
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :442 after 868
BEST_FIRST walk for 40004 steps (8 resets) in 802 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :868 after 4063
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
[2024-05-24 17:34:35] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 17:34:35] [INFO ] Computed 50 invariants in 10 ms
[2024-05-24 17:34:35] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :4063 after 12182
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-05 is UNSAT
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 21/169 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/176 variables, 29/198 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 28/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 264/440 variables, 176/402 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 72/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 474 constraints, problems are : Problem set: 1 solved, 5 unsolved in 544 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/176 variables, 47/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 101/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 17:34:36] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 8 ms to minimize.
[2024-05-24 17:34:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-24 17:34:36] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2024-05-24 17:34:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-08 is UNSAT
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 17:34:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 10 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-09 is UNSAT
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-24 17:34:37] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-08 is UNSAT
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-09 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/246 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8192
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
SDD size :12182 after 1.112e+06
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
Problem LamportFastMutEx-PT-6-ReachabilityFireability-2024-11 is UNSAT
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:34:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 13/259 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/259 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 264/440 variables, 176/435 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 72/507 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 2/509 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/509 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/509 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 509 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2966 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 3964ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 669 ms.
Support contains 51 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 353
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 175 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 174 transition count 352
Applied a total of 4 rules in 51 ms. Remains 174 /176 variables (removed 2) and now considering 352/354 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 174/176 places, 352/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 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 629372 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 2
Probabilistic random walk after 629372 steps, saw 234362 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
[2024-05-24 17:34:43] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
// Phase 1: matrix 262 rows 174 cols
[2024-05-24 17:34:43] [INFO ] Computed 50 invariants in 5 ms
[2024-05-24 17:34:43] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/172 variables, 47/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 121/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:43] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-24 17:34:43] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:34:43] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:34:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 262/434 variables, 172/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/436 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/436 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 436 ms.
Refiners :[Domain max(s): 174/174 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/172 variables, 47/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 121/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 262/434 variables, 172/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:44] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:34:44] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/436 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:44] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/436 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 479 constraints, problems are : Problem set: 0 solved, 2 unsolved in 809 ms.
Refiners :[Domain max(s): 174/174 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 174/174 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 387 ms.
Support contains 51 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 352/352 transitions.
Applied a total of 0 rules in 19 ms. Remains 174 /174 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 174/174 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 352/352 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-24 17:34:44] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
[2024-05-24 17:34:44] [INFO ] Invariant cache hit.
[2024-05-24 17:34:45] [INFO ] Implicit Places using invariants in 131 ms returned [109, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/174 places, 352/352 transitions.
Applied a total of 0 rules in 11 ms. Remains 172 /172 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 166 ms. Remains : 172/174 places, 352/352 transitions.
RANDOM walk for 40000 steps (8 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 571026 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 571026 steps, saw 213853 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-24 17:34:48] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 17:34:48] [INFO ] Computed 48 invariants in 6 ms
[2024-05-24 17:34:48] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/170 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 119/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 262/432 variables, 170/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 60/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/434 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/434 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 172/172 constraints, ReadFeed: 60/60 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/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/170 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 119/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 262/432 variables, 170/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 60/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/434 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:34:49] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/434 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1093 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 172/172 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1426ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1832 ms.
Support contains 51 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 352/352 transitions.
Applied a total of 0 rules in 16 ms. Remains 172 /172 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 172/172 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 352/352 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-24 17:34:51] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
[2024-05-24 17:34:51] [INFO ] Invariant cache hit.
[2024-05-24 17:34:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 17:34:51] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
[2024-05-24 17:34:51] [INFO ] Invariant cache hit.
[2024-05-24 17:34:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-24 17:34:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-24 17:34:51] [INFO ] Redundant transitions in 22 ms returned []
Running 346 sub problems to find dead transitions.
[2024-05-24 17:34:51] [INFO ] Flow matrix only has 262 transitions (discarded 90 similar events)
[2024-05-24 17:34:51] [INFO ] Invariant cache hit.
[2024-05-24 17:34:51] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 48/220 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:34:53] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/240 constraints. Problems are: Problem set: 8 solved, 338 unsolved
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:34:54] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:34:55] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/260 constraints. Problems are: Problem set: 13 solved, 333 unsolved
[2024-05-24 17:34:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:34:56] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:34:56] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:34:56] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-24 17:34:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/280 constraints. Problems are: Problem set: 24 solved, 322 unsolved
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:34:58] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 20/300 constraints. Problems are: Problem set: 28 solved, 318 unsolved
[2024-05-24 17:34:59] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:01] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/320 constraints. Problems are: Problem set: 28 solved, 318 unsolved
[2024-05-24 17:35:02] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:02] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:02] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:03] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 20/340 constraints. Problems are: Problem set: 32 solved, 314 unsolved
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:04] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 20/360 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:08] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.112e+06 after 4.25509e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 20/380 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 7 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 20/400 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:11] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 20/420 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 4 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/440 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:17] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/460 constraints. Problems are: Problem set: 36 solved, 310 unsolved
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:22] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 36 solved, 310 unsolved
Search for dead transitions found 36 dead transitions in 30175ms
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 : 172/172 places, 316/352 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-05-24 17:35:22] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30552 ms. Remains : 172/172 places, 316/352 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 729578 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 2
Probabilistic random walk after 729578 steps, saw 260240 distinct states, run finished after 3002 ms. (steps per millisecond=243 ) properties seen :0
[2024-05-24 17:35:25] [INFO ] Flow matrix only has 238 transitions (discarded 78 similar events)
// Phase 1: matrix 238 rows 172 cols
[2024-05-24 17:35:25] [INFO ] Computed 48 invariants in 4 ms
[2024-05-24 17:35:25] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/170 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 119/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 238/408 variables, 170/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 54/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/410 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/410 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 450 constraints, problems are : Problem set: 0 solved, 2 unsolved in 500 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 172/172 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/170 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 119/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 238/408 variables, 170/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 54/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/410 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/410 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/410 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 823 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 172/172 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 431 ms.
Support contains 51 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/172 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-05-24 17:35:27] [INFO ] Flow matrix only has 238 transitions (discarded 78 similar events)
[2024-05-24 17:35:27] [INFO ] Invariant cache hit.
[2024-05-24 17:35:27] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 17:35:27] [INFO ] Flow matrix only has 238 transitions (discarded 78 similar events)
[2024-05-24 17:35:27] [INFO ] Invariant cache hit.
[2024-05-24 17:35:27] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-24 17:35:27] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-24 17:35:27] [INFO ] Redundant transitions in 4 ms returned []
Running 310 sub problems to find dead transitions.
[2024-05-24 17:35:27] [INFO ] Flow matrix only has 238 transitions (discarded 78 similar events)
[2024-05-24 17:35:27] [INFO ] Invariant cache hit.
[2024-05-24 17:35:27] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 6/172 variables, 40/214 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 11 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
SMT process timed out in 30292ms, After SMT, problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 30296ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30699 ms. Remains : 172/172 places, 316/316 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 172 transition count 238
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 78 place count 172 transition count 211
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 1 with 79 rules applied. Total rules applied 157 place count 120 transition count 211
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 171 place count 113 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 108 transition count 227
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 108 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 183 place count 107 transition count 226
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 107 transition count 226
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 107 transition count 226
Applied a total of 187 rules in 36 ms. Remains 107 /172 variables (removed 65) and now considering 226/316 (removed 90) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 107 cols
[2024-05-24 17:35:57] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 17:35:57] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 17:35:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-05-24 17:35:58] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
TRAPS : Iteration 2
[2024-05-24 17:35:58] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 17:35:58] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 17:35:58] [INFO ] Flatten gal took : 19 ms
[2024-05-24 17:35:58] [INFO ] Flatten gal took : 16 ms
[2024-05-24 17:35:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13840316644473583557.gal : 11 ms
[2024-05-24 17:35:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5708767972299507878.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13840316644473583557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5708767972299507878.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5708767972299507878.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 114
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :114 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 158
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :158 after 260
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :260 after 1215
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1215 after 4676
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4676 after 22298
Reachability property LamportFastMutEx-PT-6-ReachabilityFireability-2024-14 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :22298 after 2.14334e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.14334e+06 after 6.59402e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.82468e+09,0.398655,18484,2,3621,17,56680,7,0,747,57970,0
Total reachable state count : 1824682230

Verifying 2 reachability properties.
Reachability property LamportFastMutEx-PT-6-ReachabilityFireability-2024-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-ReachabilityFireability-2024-10,32928,0.410729,18732,2,510,17,56680,7,0,829,57970,0
Reachability property LamportFastMutEx-PT-6-ReachabilityFireability-2024-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-ReachabilityFireability-2024-14,11190,0.411366,18732,2,572,17,56680,8,0,834,57970,0
Over-approximation ignoring read arcs solved 0 properties in 1383 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 17:35:59] [INFO ] Flatten gal took : 18 ms
[2024-05-24 17:35:59] [INFO ] Applying decomposition
[2024-05-24 17:35:59] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12596244201457560961.txt' '-o' '/tmp/graph12596244201457560961.bin' '-w' '/tmp/graph12596244201457560961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12596244201457560961.bin' '-l' '-1' '-v' '-w' '/tmp/graph12596244201457560961.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:35:59] [INFO ] Decomposing Gal with order
[2024-05-24 17:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:35:59] [INFO ] Removed a total of 527 redundant transitions.
[2024-05-24 17:35:59] [INFO ] Flatten gal took : 65 ms
[2024-05-24 17:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 15 ms.
[2024-05-24 17:35:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16396696451382476176.gal : 7 ms
[2024-05-24 17:35:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13252826919214622151.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16396696451382476176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13252826919214622151.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13252826919214622151.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 23570
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :23570 after 2.34264e+08
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2.34228e+10 after 3.47103e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.47232e+11,121.298,1955740,5040,51,2.34752e+06,407,852,4.5386e+06,71,1553,0
Total reachable state count : 547231759144

Verifying 2 reachability properties.
Reachability property LamportFastMutEx-PT-6-ReachabilityFireability-2024-10 is true.
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-ReachabilityFireability-2024-10,152,121.998,1955740,97,26,2.34752e+06,407,980,4.5386e+06,81,1553,19449
Reachability property LamportFastMutEx-PT-6-ReachabilityFireability-2024-14 does not hold.
FORMULA LamportFastMutEx-PT-6-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : LamportFastMutEx-PT-6-ReachabilityFireability-2024-14

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-ReachabilityFireability-2024-14,0,122.018,1955740,1,0,2.34752e+06,407,981,4.5386e+06,81,1553,20258
All properties solved without resorting to model-checking.
Total runtime 208450 ms.

BK_STOP 1716572281756

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-6"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-6, 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 r224-tall-171649612500295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-6.tgz
mv LamportFastMutEx-PT-6 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 ;