MCC'2024- Execution of r224-tall-171649612500309

About the Execution of ITS-Tools for LamportFastMutEx-PT-8

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16206.943	2516520.00	2844608.00	10220.00	8 7 8 7 7 ? 56 7 1 1 1 1 1 1 0 1	normal

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-171649612500309.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-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612500309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 33K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Apr 13 07:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 408K Apr 13 07:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 243K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 206K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K 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 329K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716577517040

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 19:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:05:18] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-24 19:05:18] [INFO ] Transformed 315 places.
[2024-05-24 19:05:18] [INFO ] Transformed 666 transitions.
[2024-05-24 19:05:18] [INFO ] Found NUPN structural information;
[2024-05-24 19:05:18] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_start_1_8, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_b_8_false, P_b_8_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setx_3_8, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_setbi_5_8, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_ify0_4_8, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_sety_9_8, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_ifxi_10_8, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_setbi_11_8, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_fordo_12_8, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_0_8, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_1_8, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_2_8, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_3_8, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_4_8, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_5_8, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_await_13_8, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_0_8, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_1_8, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_2_8, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_3_8, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_4_8, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_5_8, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_CS_21_8, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7, P_setbi_24_8]
[2024-05-24 19:05:18] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 49 places in 10 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 1, 1, 1, 1, 1, 1]
[2024-05-24 19:05:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 19:05:18] [INFO ] Computed 82 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA LamportFastMutEx-PT-8-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 129 ms. (538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 6, 7, 4, 48, 6] Max Struct:[8, 8, 8, 8, 8, 64, 8]
[2024-05-24 19:05:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 19:05:18] [INFO ] Invariant cache hit.
[2024-05-24 19:05:18] [INFO ] [Real]Absence check using 82 positive place invariants in 28 ms returned sat
[2024-05-24 19:05:19] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-24 19:05:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:05:19] [INFO ] [Real]Added 112 Read/Feed constraints in 20 ms returned sat
[2024-05-24 19:05:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2024-05-24 19:05:19] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-24 19:05:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 21 ms to minimize.
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 6 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-24 19:05:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2639 ms
[2024-05-24 19:05:22] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2024-05-24 19:05:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2024-05-24 19:05:22] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 40 ms.
[2024-05-24 19:05:22] [INFO ] Added : 0 causal constraints over 0 iterations in 83 ms. Result :sat
Minimization took 87 ms.
[2024-05-24 19:05:22] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2024-05-24 19:05:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 19:05:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 4 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1324 ms
[2024-05-24 19:05:24] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2024-05-24 19:05:25] [INFO ] Added : 64 causal constraints over 15 iterations in 812 ms. Result :sat
Minimization took 121 ms.
[2024-05-24 19:05:25] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:25] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 19:05:25] [INFO ] [Real]Added 112 Read/Feed constraints in 8 ms returned sat
[2024-05-24 19:05:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:25] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:25] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-24 19:05:25] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 955 ms
[2024-05-24 19:05:26] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:26] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 19:05:26] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2024-05-24 19:05:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:26] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:26] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 19:05:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 19:05:26] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 39 ms.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 3 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 502 ms
[2024-05-24 19:05:27] [INFO ] Added : 52 causal constraints over 11 iterations in 869 ms. Result :sat
Minimization took 131 ms.
[2024-05-24 19:05:28] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 19:05:28] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-24 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2024-05-24 19:05:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 19:05:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 162 ms returned sat
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1160 ms
[2024-05-24 19:05:29] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 36 ms.
[2024-05-24 19:05:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 19:05:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 19:05:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 19:05:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2024-05-24 19:05:30] [INFO ] Added : 53 causal constraints over 12 iterations in 639 ms. Result :sat
Minimization took 213 ms.
[2024-05-24 19:05:30] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 19:05:30] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-24 19:05:30] [INFO ] [Real]Added 112 Read/Feed constraints in 9 ms returned sat
[2024-05-24 19:05:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:30] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 19:05:30] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-24 19:05:30] [INFO ] [Nat]Added 112 Read/Feed constraints in 22 ms returned sat
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1163 ms
[2024-05-24 19:05:32] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:05:33] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:05:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 19:05:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 545 ms
[2024-05-24 19:05:33] [INFO ] Added : 81 causal constraints over 17 iterations in 1121 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 6, 7, 4, 48, 6] Max Struct:[7, 8, 8, 7, 8, 64, 8]
FORMULA LamportFastMutEx-PT-8-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 48, 7] Max Struct:[8, 8, 64, 8]
Support contains 88 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 35 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 266/266 places, 584/584 transitions.
[2024-05-24 19:05:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 19:05:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 48, 7] Max Struct:[8, 8, 64, 8]
RANDOM walk for 1000000 steps (2 resets) in 3526 ms. (283 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 5066 ms. (789 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 6, 49, 7] Max Struct:[8, 8, 64, 8]
[2024-05-24 19:05:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 19:05:43] [INFO ] Invariant cache hit.
[2024-05-24 19:05:43] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 19:05:43] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 19:05:43] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:05:43] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2024-05-24 19:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:43] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:43] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-24 19:05:43] [INFO ] [Nat]Added 112 Read/Feed constraints in 27 ms returned sat
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:05:44] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:05:45] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 19:05:45] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:05:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1231 ms
[2024-05-24 19:05:45] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:45] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-24 19:05:45] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2024-05-24 19:05:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2024-05-24 19:05:45] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 19:05:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 19:05:45] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2024-05-24 19:05:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 19:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-24 19:05:46] [INFO ] Added : 72 causal constraints over 16 iterations in 535 ms. Result :sat
Minimization took 151 ms.
[2024-05-24 19:05:46] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 19:05:46] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 19:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:46] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 19:05:46] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 19:05:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 113 ms returned sat
[2024-05-24 19:05:46] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-24 19:05:46] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 19:05:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1205 ms
[2024-05-24 19:05:47] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2024-05-24 19:05:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 19:05:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 19:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-05-24 19:05:48] [INFO ] Added : 77 causal constraints over 16 iterations in 673 ms. Result :sat
Minimization took 211 ms.
[2024-05-24 19:05:48] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-24 19:05:49] [INFO ] [Real]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 19:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 19:05:49] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-24 19:05:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 23 ms returned sat
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:05:49] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 19:05:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1268 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7, 6, 49, 7] Max Struct:[7, 8, 64, 7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 49] Max Struct:[8, 64]
Support contains 72 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 266 transition count 576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 57 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 258/266 places, 576/584 transitions.
[2024-05-24 19:05:51] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 19:05:51] [INFO ] Computed 82 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 49] Max Struct:[8, 64]
RANDOM walk for 1000000 steps (2 resets) in 3257 ms. (306 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2764 ms. (723 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 49] Max Struct:[8, 64]
[2024-05-24 19:05:57] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:05:57] [INFO ] Invariant cache hit.
[2024-05-24 19:05:57] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 19:05:57] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 19:05:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:05:57] [INFO ] [Real]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 19:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:57] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 19:05:57] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 19:05:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 19:05:57] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:05:58] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-05-24 19:05:59] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:05:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1066 ms
[2024-05-24 19:05:59] [INFO ] Added : 71 causal constraints over 15 iterations in 1537 ms. Result :sat
Minimization took 146 ms.
[2024-05-24 19:05:59] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 19:05:59] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-24 19:05:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:59] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 19:05:59] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-24 19:05:59] [INFO ] [Nat]Added 112 Read/Feed constraints in 128 ms returned sat
[2024-05-24 19:05:59] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:06:00] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:06:01] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 19:06:01] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:06:01] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:06:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1449 ms
[2024-05-24 19:06:01] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 32 ms.
[2024-05-24 19:06:01] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:06:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:06:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2024-05-24 19:06:02] [INFO ] Added : 79 causal constraints over 18 iterations in 804 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 49] Max Struct:[8, 64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 49] Max Struct:[8, 64]
Support contains 72 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 22 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 258/258 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-24 19:06:03] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:06:03] [INFO ] Invariant cache hit.
[2024-05-24 19:06:03] [INFO ] Implicit Places using invariants in 409 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 418 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/258 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 448 ms. Remains : 250/258 places, 576/576 transitions.
[2024-05-24 19:06:03] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 19:06:03] [INFO ] Computed 74 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 49] Max Struct:[8, 64]
RANDOM walk for 1000000 steps (2 resets) in 3327 ms. (300 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2587 ms. (772 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 55] Max Struct:[8, 64]
[2024-05-24 19:06:09] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:06:09] [INFO ] Invariant cache hit.
[2024-05-24 19:06:09] [INFO ] [Real]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:06:09] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-24 19:06:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 19:06:09] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-24 19:06:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:06:09] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:06:09] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 19:06:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2024-05-24 19:06:09] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:06:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-24 19:06:09] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 32 ms.
[2024-05-24 19:06:10] [INFO ] Added : 142 causal constraints over 30 iterations in 964 ms. Result :sat
Minimization took 154 ms.
[2024-05-24 19:06:11] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2024-05-24 19:06:11] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 19:06:11] [INFO ] [Real]Added 48 Read/Feed constraints in 12 ms returned sat
[2024-05-24 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:06:11] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:06:11] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-24 19:06:11] [INFO ] [Nat]Added 48 Read/Feed constraints in 50 ms returned sat
[2024-05-24 19:06:11] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:06:11] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:06:11] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:06:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:06:11] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:06:12] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:06:13] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:06:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 19:06:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1788 ms
[2024-05-24 19:06:13] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 19:06:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:06:14] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:06:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 19:06:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2024-05-24 19:06:14] [INFO ] Added : 152 causal constraints over 32 iterations in 1439 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 55] Max Struct:[8, 64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 55] Max Struct:[8, 64]
Support contains 72 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 250/250 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-24 19:06:15] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:06:15] [INFO ] Invariant cache hit.
[2024-05-24 19:06:15] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-24 19:06:15] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:06:15] [INFO ] Invariant cache hit.
[2024-05-24 19:06:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 19:06:16] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-24 19:06:16] [INFO ] Redundant transitions in 34 ms returned []
Running 568 sub problems to find dead transitions.
[2024-05-24 19:06:16] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 19:06:16] [INFO ] Invariant cache hit.
[2024-05-24 19:06:16] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 74/324 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 19:06:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:06:20] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 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
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/344 constraints. Problems are: Problem set: 6 solved, 562 unsolved
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 19:06:21] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:06:22] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:06:23] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/364 constraints. Problems are: Problem set: 16 solved, 552 unsolved
[2024-05-24 19:06:25] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-24 19:06:26] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 19:06:27] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 20/384 constraints. Problems are: Problem set: 26 solved, 542 unsolved
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:06:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-24 19:06:29] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 20/404 constraints. Problems are: Problem set: 32 solved, 536 unsolved
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 5 ms to minimize.
[2024-05-24 19:06:30] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:06:31] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:06:31] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:06:31] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 2 ms to minimize.
[2024-05-24 19:06:31] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 2 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 20/424 constraints. Problems are: Problem set: 34 solved, 534 unsolved
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:06:36] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:06:37] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2024-05-24 19:06:37] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:06:37] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:06:37] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:06:37] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:06:38] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-24 19:06:39] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:06:39] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 20/444 constraints. Problems are: Problem set: 36 solved, 532 unsolved
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:06:40] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:06:41] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/464 constraints. Problems are: Problem set: 42 solved, 526 unsolved
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:06:42] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:06:43] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:06:44] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:06:44] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:06:44] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2024-05-24 19:06:44] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:06:44] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:06:45] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 20/484 constraints. Problems are: Problem set: 44 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/658 variables, and 484 constraints, problems are : Problem set: 44 solved, 524 unsolved in 30024 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/250 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 44 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 10/252 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 99/351 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/351 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 8/250 variables, 64/415 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 8/423 constraints. Problems are: Problem set: 44 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 61/484 constraints. Problems are: Problem set: 44 solved, 524 unsolved
[2024-05-24 19:06:50] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-24 19:06:50] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:06:50] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 19:06:51] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:06:51] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:06:51] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-24 19:06:51] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-24 19:06:52] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:06:53] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 20/504 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:06:54] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:06:54] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:06:54] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:06:55] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:06:56] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:06:57] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/524 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:06:57] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:06:58] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:06:59] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:07:00] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:07:00] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:07:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:07:00] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 20/544 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:07:01] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:07:02] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:07:03] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:07:03] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 20 ms to minimize.
[2024-05-24 19:07:03] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:07:03] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 20/564 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:07:04] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:07:04] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:07:04] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:07:05] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:07:06] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/584 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:07:07] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:07:07] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:07:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:07:09] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:07:10] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:07:10] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2024-05-24 19:07:10] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 20/604 constraints. Problems are: Problem set: 48 solved, 520 unsolved
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:07:15] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2024-05-24 19:07:16] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:07:16] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:07:16] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
SMT process timed out in 60429ms, After SMT, problems are : Problem set: 48 solved, 520 unsolved
Search for dead transitions found 48 dead transitions in 60445ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/250 places, 528/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-24 19:07:16] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61173 ms. Remains : 250/250 places, 528/576 transitions.
[2024-05-24 19:07:16] [INFO ] Flow matrix only has 376 transitions (discarded 152 similar events)
// Phase 1: matrix 376 rows 250 cols
[2024-05-24 19:07:16] [INFO ] Computed 74 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 55] Max Struct:[8, 64]
RANDOM walk for 1000000 steps (2 resets) in 3007 ms. (332 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2319 ms. (862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 56] Max Struct:[8, 64]
[2024-05-24 19:07:22] [INFO ] Flow matrix only has 376 transitions (discarded 152 similar events)
[2024-05-24 19:07:22] [INFO ] Invariant cache hit.
[2024-05-24 19:07:22] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2024-05-24 19:07:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 19:07:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:07:22] [INFO ] [Real]Added 40 Read/Feed constraints in 25 ms returned sat
[2024-05-24 19:07:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:22] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 19:07:22] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-24 19:07:22] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-24 19:07:22] [INFO ] Computed and/alt/rep : 256/1376/256 causal constraints (skipped 112 transitions) in 25 ms.
[2024-05-24 19:07:23] [INFO ] Added : 143 causal constraints over 29 iterations in 790 ms. Result :sat
Minimization took 147 ms.
[2024-05-24 19:07:23] [INFO ] [Real]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:07:23] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 19:07:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:07:23] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-24 19:07:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 133 ms returned sat
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:07:24] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:07:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1143 ms
Current structural bounds on expressions (after SMT) : Max Seen:[6, 56] Max Struct:[8, 56]
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 528/528 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 520
Applied a total of 16 rules in 28 ms. Remains 242 /250 variables (removed 8) and now considering 520/528 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 242/250 places, 520/528 transitions.
[2024-05-24 19:07:25] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2024-05-24 19:07:25] [INFO ] Computed 74 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2155 ms. (463 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 655 ms. (1524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-05-24 19:07:28] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:07:28] [INFO ] Invariant cache hit.
[2024-05-24 19:07:28] [INFO ] [Real]Absence check using 74 positive place invariants in 17 ms returned sat
[2024-05-24 19:07:28] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 19:07:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:07:28] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-05-24 19:07:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:28] [INFO ] [Nat]Absence check using 74 positive place invariants in 18 ms returned sat
[2024-05-24 19:07:28] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-24 19:07:28] [INFO ] [Nat]Added 40 Read/Feed constraints in 27 ms returned sat
[2024-05-24 19:07:28] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 22 ms.
[2024-05-24 19:07:29] [INFO ] Added : 125 causal constraints over 25 iterations in 716 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-24 19:07:29] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:07:29] [INFO ] Invariant cache hit.
[2024-05-24 19:07:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-24 19:07:30] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:07:30] [INFO ] Invariant cache hit.
[2024-05-24 19:07:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:07:30] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-05-24 19:07:30] [INFO ] Redundant transitions in 3 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-24 19:07:30] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:07:30] [INFO ] Invariant cache hit.
[2024-05-24 19:07:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:07:37] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:07:38] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:07:39] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-24 19:07:40] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-24 19:07:41] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-24 19:07:41] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:07:41] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 19:07:41] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:07:41] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:07:44] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:07:45] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:46] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 19:07:46] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:07:46] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:07:46] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:07:47] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:07:48] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 10 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:07:49] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:07:50] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:07:51] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-24 19:07:51] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:51] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:07:51] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:07:51] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:53] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:07:53] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:07:54] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:07:55] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:07:56] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:56] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-24 19:07:56] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:56] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:57] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:07:58] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:07:59] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:08:00] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:08:01] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
SMT process timed out in 30443ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30447ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31378 ms. Remains : 242/242 places, 520/520 transitions.
RANDOM walk for 40000 steps (8 resets) in 975 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-05-24 19:08:02] [INFO ] Flatten gal took : 205 ms
[2024-05-24 19:08:02] [INFO ] Flatten gal took : 92 ms
[2024-05-24 19:08:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18122184034496721310.gal : 64 ms
[2024-05-24 19:08:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5857292498054513483.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/ReachabilityCardinality18122184034496721310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5857292498054513483.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/ReachabilityCardinality5857292498054513483.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 71
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :71 after 122
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :122 after 1046
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1046 after 2064
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2064 after 12911
Interrupted probabilistic random walk after 275148 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 275148 steps, saw 149464 distinct states, run finished after 3018 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-24 19:08:04] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:08:04] [INFO ] Invariant cache hit.
[2024-05-24 19:08:04] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 505 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:08:05] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1024 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1603ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1932 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 242/242 places, 520/520 transitions.
RANDOM walk for 40000 steps (8 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12911 after 215769
Interrupted probabilistic random walk after 424137 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 424137 steps, saw 223455 distinct states, run finished after 3017 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-24 19:08:11] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:08:11] [INFO ] Invariant cache hit.
[2024-05-24 19:08:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :215769 after 327353
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:08:12] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 896 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1495ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1215 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-24 19:08:14] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:08:14] [INFO ] Invariant cache hit.
[2024-05-24 19:08:14] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-24 19:08:14] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:08:14] [INFO ] Invariant cache hit.
[2024-05-24 19:08:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:08:15] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2024-05-24 19:08:15] [INFO ] Redundant transitions in 2 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-24 19:08:15] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:08:15] [INFO ] Invariant cache hit.
[2024-05-24 19:08:15] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :327353 after 1.51793e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:08:32] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-24 19:08:32] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:08:39] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 18 places in 1104 ms of which 1 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:08:46] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
SMT process timed out in 30410ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31757 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 368 place count 106 transition count 288
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Applied a total of 392 rules in 48 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2024-05-24 19:08:46] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 19:08:46] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-24 19:08:46] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 19:08:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 19:08:46] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 19:08:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-24 19:08:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-24 19:08:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-24 19:08:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 19:08:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-05-24 19:08:46] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 19:08:46] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 19:08:46] [INFO ] Flatten gal took : 21 ms
[2024-05-24 19:08:46] [INFO ] Flatten gal took : 18 ms
[2024-05-24 19:08:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8549243224560719328.gal : 4 ms
[2024-05-24 19:08:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7112585921095432647.prop : 0 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/ReachabilityCardinality8549243224560719328.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7112585921095432647.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 ...328
Loading property file /tmp/ReachabilityCardinality7112585921095432647.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 113
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :113 after 167
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :167 after 1344
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1344 after 2325
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2325 after 23649
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :23649 after 122224
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :122224 after 1.1493e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.1493e+06 after 4.58576e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.58576e+06 after 3.65072e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.65072e+07 after 7.46528e+07
Detected timeout of ITS tools.
[2024-05-24 19:08:53] [INFO ] Flatten gal took : 31 ms
[2024-05-24 19:08:53] [INFO ] Applying decomposition
[2024-05-24 19:08:53] [INFO ] Flatten gal took : 27 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/graph2132659239834159911.txt' '-o' '/tmp/graph2132659239834159911.bin' '-w' '/tmp/graph2132659239834159911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2132659239834159911.bin' '-l' '-1' '-v' '-w' '/tmp/graph2132659239834159911.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:08:53] [INFO ] Decomposing Gal with order
[2024-05-24 19:08:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:08:53] [INFO ] Removed a total of 758 redundant transitions.
[2024-05-24 19:08:53] [INFO ] Flatten gal took : 169 ms
[2024-05-24 19:08:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 229 labels/synchronizations in 35 ms.
[2024-05-24 19:08:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8630866450197200674.gal : 5 ms
[2024-05-24 19:08:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18271687320674299172.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/ReachabilityCardinality8630866450197200674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18271687320674299172.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/ReachabilityCardinality18271687320674299172.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 32
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :32 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 74
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :74 after 134
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :134 after 234
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :234 after 1201
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1201 after 2814
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2814 after 6348
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6348 after 64740
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :64740 after 114015
Detected timeout of ITS tools.
[2024-05-24 19:09:01] [INFO ] Flatten gal took : 17 ms
[2024-05-24 19:09:01] [INFO ] Applying decomposition
[2024-05-24 19:09:01] [INFO ] Flatten gal took : 27 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/graph6116912138504529809.txt' '-o' '/tmp/graph6116912138504529809.bin' '-w' '/tmp/graph6116912138504529809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6116912138504529809.bin' '-l' '-1' '-v' '-w' '/tmp/graph6116912138504529809.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:09:01] [INFO ] Decomposing Gal with order
[2024-05-24 19:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:09:01] [INFO ] Removed a total of 491 redundant transitions.
[2024-05-24 19:09:01] [INFO ] Flatten gal took : 52 ms
[2024-05-24 19:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 8 ms.
[2024-05-24 19:09:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5530261393584640416.gal : 3 ms
[2024-05-24 19:09:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15051937674867636873.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/ReachabilityCardinality5530261393584640416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15051937674867636873.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/ReachabilityCardinality15051937674867636873.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 83
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :83 after 89
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :89 after 105
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :105 after 211
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :211 after 951
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :951 after 3543
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3543 after 12291
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :12291 after 81495
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :81495 after 6.29018e+08
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
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\_flatf,1.49831e+10,1.37452,48452,2,7693,18,214035,6,0,662,208256,0
Total reachable state count : 14983148960

Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,1.38311,48452,2,99,18,214035,7,0,723,208256,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,1.39318,48452,2,99,18,214035,8,0,783,208256,0
Over-approximation ignoring read arcs solved 0 properties in 17283 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[8]
Starting property specific reduction for LamportFastMutEx-PT-8-UpperBounds-05
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-24 19:09:03] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2024-05-24 19:09:03] [INFO ] Computed 74 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-05-24 19:09:03] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:03] [INFO ] Invariant cache hit.
[2024-05-24 19:09:03] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 19:09:03] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-24 19:09:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:09:03] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-05-24 19:09:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:09:03] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 19:09:03] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-24 19:09:03] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-05-24 19:09:03] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 45 ms.
[2024-05-24 19:09:04] [INFO ] Added : 52 causal constraints over 11 iterations in 351 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 520/520 transitions.
[2024-05-24 19:09:04] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2226 ms. (449 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 655 ms. (1524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-05-24 19:09:07] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:07] [INFO ] Invariant cache hit.
[2024-05-24 19:09:07] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 19:09:07] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 19:09:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:09:07] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-24 19:09:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:09:07] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 19:09:07] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-24 19:09:07] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-24 19:09:07] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 22 ms.
[2024-05-24 19:09:08] [INFO ] Added : 142 causal constraints over 29 iterations in 762 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-24 19:09:08] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:08] [INFO ] Invariant cache hit.
[2024-05-24 19:09:09] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-24 19:09:09] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:09] [INFO ] Invariant cache hit.
[2024-05-24 19:09:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:09:09] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2024-05-24 19:09:09] [INFO ] Redundant transitions in 5 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-24 19:09:09] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:09:09] [INFO ] Invariant cache hit.
[2024-05-24 19:09:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 10 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:09:16] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:09:17] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:09:18] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:09:19] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:09:20] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 19:09:20] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:09:20] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:09:22] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:09:23] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:09:24] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 13 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 19:09:25] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:09:26] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:27] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:28] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:09:29] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:09:32] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:33] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:09:34] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 476 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30024 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 99/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 8/242 variables, 64/407 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 61/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:43] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:09:43] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:43] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:09:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 9 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:46] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 19:09:46] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:09:46] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-05-24 19:09:46] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:49] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:09:49] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 19:09:49] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:09:49] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-24 19:09:49] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 2 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:09:50] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-24 19:09:51] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:52] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:09:52] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:09:53] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:09:57] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:09:57] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:09:57] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:09:59] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:00] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:10:00] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:10:00] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:00] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:04] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:07] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:07] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:07] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:08] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:10:08] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:08] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:10:08] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
SMT process timed out in 60374ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61188 ms. Remains : 242/242 places, 520/520 transitions.
[2024-05-24 19:10:09] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:10:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2142 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 643 ms. (1552 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-05-24 19:10:12] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:10:12] [INFO ] Invariant cache hit.
[2024-05-24 19:10:12] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 19:10:12] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-24 19:10:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:10:12] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-05-24 19:10:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:10:12] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2024-05-24 19:10:13] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-24 19:10:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-05-24 19:10:13] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 21 ms.
[2024-05-24 19:10:13] [INFO ] Added : 125 causal constraints over 25 iterations in 642 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-24 19:10:14] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:10:14] [INFO ] Invariant cache hit.
[2024-05-24 19:10:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-24 19:10:14] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:10:14] [INFO ] Invariant cache hit.
[2024-05-24 19:10:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:10:14] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-24 19:10:14] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-24 19:10:14] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:10:14] [INFO ] Invariant cache hit.
[2024-05-24 19:10:14] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:36] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:10:36] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:37] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:10:38] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-24 19:10:39] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-24 19:10:39] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-24 19:10:39] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:10:39] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:40] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:10:44] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 timeout
0.0)
(s29 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 476 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30024 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 99/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 8/242 variables, 64/407 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 61/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:48] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:02] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:11:02] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:11:02] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:05] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:11:15] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
SMT process timed out in 60291ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60997 ms. Remains : 242/242 places, 520/520 transitions.
[2024-05-24 19:11:15] [INFO ] Flatten gal took : 26 ms
[2024-05-24 19:11:15] [INFO ] Flatten gal took : 44 ms
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
[2024-05-24 19:11:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11418063006286536503.gal : 5 ms
[2024-05-24 19:11:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3616024296034385405.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/ReachabilityCardinality11418063006286536503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3616024296034385405.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
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3616024296034385405.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 71
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :71 after 122
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :122 after 1046
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1046 after 2064
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2064 after 12911
Interrupted probabilistic random walk after 511603 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 2
Probabilistic random walk after 511603 steps, saw 266499 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-24 19:11:18] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:11:18] [INFO ] Invariant cache hit.
[2024-05-24 19:11:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:11:18] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 934 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 16 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 242/242 places, 520/520 transitions.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12911 after 215769
Interrupted probabilistic random walk after 486407 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 2
Probabilistic random walk after 486407 steps, saw 254827 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-24 19:11:22] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:11:22] [INFO ] Invariant cache hit.
[2024-05-24 19:11:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 228 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:11:23] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 417 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :215769 after 327353
Parikh walk visited 0 properties in 1024 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-24 19:11:24] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:11:24] [INFO ] Invariant cache hit.
[2024-05-24 19:11:24] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-24 19:11:24] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:11:24] [INFO ] Invariant cache hit.
[2024-05-24 19:11:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 19:11:25] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-24 19:11:25] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-24 19:11:25] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-05-24 19:11:25] [INFO ] Invariant cache hit.
[2024-05-24 19:11:25] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 5 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :327353 after 1.51793e+06
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
(s128 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 476 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30021 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 99/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 8/242 variables, 64/407 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 61/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 19:12:05] [INFO ] Flatten gal took : 23 ms
[2024-05-24 19:12:05] [INFO ] Applying decomposition
[2024-05-24 19:12:05] [INFO ] Flatten gal took : 19 ms
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
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/graph3797799425362530712.txt' '-o' '/tmp/graph3797799425362530712.bin' '-w' '/tmp/graph3797799425362530712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3797799425362530712.bin' '-l' '-1' '-v' '-w' '/tmp/graph3797799425362530712.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:05] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:05] [INFO ] Removed a total of 767 redundant transitions.
[2024-05-24 19:12:05] [INFO ] Flatten gal took : 61 ms
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-05-24 19:12:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 15 ms.
[2024-05-24 19:12:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4554731913470194228.gal : 3 ms
[2024-05-24 19:12:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2214591542551791002.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/ReachabilityCardinality4554731913470194228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2214591542551791002.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 ...328
Loading property file /tmp/ReachabilityCardinality2214591542551791002.prop.
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 116
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :116 after 231
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :231 after 1422
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1422 after 3012
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3012 after 38136
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-24 19:12:07] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:12:07] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :38136 after 68425
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:07] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :68425 after 160878
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
SDD size :160878 after 500064
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:12:10] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-24 19:12:12] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:12:12] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:12] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:12] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:12:15] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:12:15] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:15] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-24 19:12:15] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:15] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2024-05-24 19:12:16] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:16] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-24 19:12:16] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 19:12:16] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:17] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-24 19:12:18] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
SDD size :500064 after 3.5269e+07
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:12:20] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-24 19:12:21] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 19:12:22] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/610 variables, and 656 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30037 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 340/340 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61001 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 368 place count 106 transition count 288
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Applied a total of 392 rules in 20 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2024-05-24 19:12:25] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 19:12:25] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-05-24 19:12:25] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 19:12:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 19:12:26] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 19:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 19:12:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-24 19:12:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-24 19:12:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-24 19:12:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-05-24 19:12:26] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 19:12:26] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 19:12:26] [INFO ] Flatten gal took : 9 ms
[2024-05-24 19:12:26] [INFO ] Flatten gal took : 9 ms
[2024-05-24 19:12:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16209174318992132290.gal : 2 ms
[2024-05-24 19:12:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality636679410095725363.prop : 0 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/ReachabilityCardinality16209174318992132290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality636679410095725363.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 ...328
Loading property file /tmp/ReachabilityCardinality636679410095725363.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 113
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :113 after 167
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :167 after 1344
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1344 after 2325
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2325 after 23649
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :23649 after 122224
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :122224 after 1.1493e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.1493e+06 after 4.58576e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.5269e+07 after 8.86642e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.58576e+06 after 3.65072e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.65072e+07 after 7.46528e+07
Detected timeout of ITS tools.
[2024-05-24 19:12:41] [INFO ] Flatten gal took : 11 ms
[2024-05-24 19:12:41] [INFO ] Applying decomposition
[2024-05-24 19:12:41] [INFO ] Flatten gal took : 20 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/graph12833949019304157816.txt' '-o' '/tmp/graph12833949019304157816.bin' '-w' '/tmp/graph12833949019304157816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12833949019304157816.bin' '-l' '-1' '-v' '-w' '/tmp/graph12833949019304157816.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:41] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:41] [INFO ] Removed a total of 491 redundant transitions.
[2024-05-24 19:12:41] [INFO ] Flatten gal took : 56 ms
[2024-05-24 19:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 7 ms.
[2024-05-24 19:12:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6038380827892902923.gal : 16 ms
[2024-05-24 19:12:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7090181025114260077.prop : 0 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/ReachabilityCardinality6038380827892902923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7090181025114260077.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 ...328
Loading property file /tmp/ReachabilityCardinality7090181025114260077.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :150 after 2336
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2336 after 8415
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8415 after 18724
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :18724 after 1.89293e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.89293e+06 after 1.79737e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.24696e+09 after 2.50997e+09
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\_flatf,1.56368e+10,3.01231,89760,2,13444,18,348780,8,0,664,484786,0
Total reachable state count : 15636821984

Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,1,3.02525,89760,2,99,18,348780,8,0,724,484786,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,3.03919,89760,2,99,18,348780,8,0,783,484786,0
Over-approximation ignoring read arcs solved 0 properties in 19057 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[8]
Ending property specific reduction for LamportFastMutEx-PT-8-UpperBounds-05 in 221425 ms.
[2024-05-24 19:12:44] [INFO ] Flatten gal took : 24 ms
[2024-05-24 19:12:44] [INFO ] Applying decomposition
[2024-05-24 19:12:44] [INFO ] Flatten gal took : 24 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/graph16913308201799195311.txt' '-o' '/tmp/graph16913308201799195311.bin' '-w' '/tmp/graph16913308201799195311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16913308201799195311.bin' '-l' '-1' '-v' '-w' '/tmp/graph16913308201799195311.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:44] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:44] [INFO ] Removed a total of 833 redundant transitions.
[2024-05-24 19:12:44] [INFO ] Flatten gal took : 25 ms
[2024-05-24 19:12:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2024-05-24 19:12:44] [INFO ] Time to serialize gal into /tmp/UpperBounds3154991945038302317.gal : 3 ms
[2024-05-24 19:12:44] [INFO ] Time to serialize properties into /tmp/UpperBounds15296701547935003672.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/UpperBounds3154991945038302317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15296701547935003672.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 ...305
Loading property file /tmp/UpperBounds15296701547935003672.prop.
ITS-tools command line returned an error code 137
[2024-05-24 19:25:18] [INFO ] Applying decomposition
[2024-05-24 19:25:18] [INFO ] Flatten gal took : 18 ms
[2024-05-24 19:25:18] [INFO ] Decomposing Gal with order
[2024-05-24 19:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:25:18] [INFO ] Removed a total of 599 redundant transitions.
[2024-05-24 19:25:18] [INFO ] Flatten gal took : 52 ms
[2024-05-24 19:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 6 ms.
[2024-05-24 19:25:18] [INFO ] Time to serialize gal into /tmp/UpperBounds6641350517120589010.gal : 3 ms
[2024-05-24 19:25:18] [INFO ] Time to serialize properties into /tmp/UpperBounds18358522769618674524.prop : 0 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/UpperBounds6641350517120589010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18358522769618674524.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 ...305
Loading property file /tmp/UpperBounds18358522769618674524.prop.
ITS-tools command line returned an error code 137
[2024-05-24 19:35:57] [INFO ] Flatten gal took : 23 ms
[2024-05-24 19:35:57] [INFO ] Input system was already deterministic with 520 transitions.
[2024-05-24 19:35:57] [INFO ] Transformed 242 places.
[2024-05-24 19:35:57] [INFO ] Transformed 520 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 19:35:57] [INFO ] Time to serialize gal into /tmp/UpperBounds10637407504408352418.gal : 3 ms
[2024-05-24 19:35:57] [INFO ] Time to serialize properties into /tmp/UpperBounds9776950375624769632.prop : 0 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/UpperBounds10637407504408352418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9776950375624769632.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9776950375624769632.prop.
ITS-tools command line returned an error code 137
Total runtime 2515328 ms.

BK_STOP 1716580033560

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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-8"
export BK_EXAMINATION="UpperBounds"
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-8, examination is UpperBounds"
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-171649612500309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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