MCC'2024- Execution of r223-tall-171649611200309

About the Execution of GreatSPN+red for LamportFastMutEx-PT-8

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
12792.312	3600000.00	4960938.00	9073.10	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.r223-tall-171649611200309.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 greatspnxred
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 r223-tall-171649611200309
=====================================================================

--------------------
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 1716538969213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 08:22:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 08:22:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:22:50] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-24 08:22:50] [INFO ] Transformed 315 places.
[2024-05-24 08:22:50] [INFO ] Transformed 666 transitions.
[2024-05-24 08:22:50] [INFO ] Found NUPN structural information;
[2024-05-24 08:22:50] [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 08:22:50] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 49 places in 8 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 08:22:50] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 08:22:50] [INFO ] Computed 82 invariants in 16 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 68 ms. (144 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 132 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 6, 7, 5, 33, 6] Max Struct:[8, 8, 8, 8, 8, 64, 8]
[2024-05-24 08:22:50] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 08:22:50] [INFO ] Invariant cache hit.
[2024-05-24 08:22:51] [INFO ] [Real]Absence check using 82 positive place invariants in 31 ms returned sat
[2024-05-24 08:22:51] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-24 08:22:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 08:22:51] [INFO ] [Real]Added 112 Read/Feed constraints in 20 ms returned sat
[2024-05-24 08:22:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2024-05-24 08:22:51] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:22:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 29 ms returned sat
[2024-05-24 08:22:51] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 13 ms to minimize.
[2024-05-24 08:22:51] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 13 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 7 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 5 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2710 ms
[2024-05-24 08:22:54] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:22:54] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-24 08:22:54] [INFO ] [Real]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 08:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2024-05-24 08:22:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:22:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2024-05-24 08:22:54] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 36 ms.
[2024-05-24 08:22:54] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Minimization took 87 ms.
[2024-05-24 08:22:54] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 08:22:55] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:22:55] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2024-05-24 08:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:22:55] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 08:22:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1282 ms
[2024-05-24 08:22:56] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 39 ms.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2024-05-24 08:22:57] [INFO ] Added : 64 causal constraints over 15 iterations in 750 ms. Result :sat
Minimization took 120 ms.
[2024-05-24 08:22:57] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:22:57] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-24 08:22:57] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2024-05-24 08:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:57] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 08:22:57] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-24 08:22:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 949 ms
[2024-05-24 08:22:58] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:22:58] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 08:22:58] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2024-05-24 08:22:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:59] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 08:22:59] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 08:22:59] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 08:22:59] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 31 ms.
[2024-05-24 08:22:59] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:22:59] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-24 08:22:59] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:00] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 08:23:00] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:23:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 579 ms
[2024-05-24 08:23:00] [INFO ] Added : 67 causal constraints over 14 iterations in 1020 ms. Result :sat
Minimization took 178 ms.
[2024-05-24 08:23:00] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:23:00] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-24 08:23:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:00] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 08:23:00] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 08:23:00] [INFO ] [Nat]Added 112 Read/Feed constraints in 106 ms returned sat
[2024-05-24 08:23:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:00] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 8 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 518 ms
[2024-05-24 08:23:01] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 30 ms.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:23:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 08:23:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:23:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 368 ms
[2024-05-24 08:23:02] [INFO ] Added : 57 causal constraints over 13 iterations in 820 ms. Result :sat
Minimization took 315 ms.
[2024-05-24 08:23:02] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:23:02] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 08:23:02] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2024-05-24 08:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:23:02] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 08:23:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1086 ms
[2024-05-24 08:23:04] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 37 ms.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 491 ms
[2024-05-24 08:23:05] [INFO ] Added : 81 causal constraints over 17 iterations in 1069 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 6, 7, 5, 33, 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, 36, 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 46 ms. Remains : 266/266 places, 584/584 transitions.
[2024-05-24 08:23:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 08:23:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 36, 7] Max Struct:[8, 8, 64, 8]
RANDOM walk for 1000000 steps (2 resets) in 3369 ms. (296 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 4922 ms. (812 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 6, 56, 7] Max Struct:[8, 8, 64, 8]
[2024-05-24 08:23:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 08:23:14] [INFO ] Invariant cache hit.
[2024-05-24 08:23:14] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 08:23:15] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 08:23:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 08:23:15] [INFO ] [Real]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 08:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 08:23:15] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 08:23:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 26 ms returned sat
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-24 08:23:15] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1148 ms
[2024-05-24 08:23:16] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 08:23:16] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 08:23:16] [INFO ] [Real]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 08:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:23:16] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 08:23:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 08:23:16] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
[2024-05-24 08:23:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-24 08:23:17] [INFO ] Added : 72 causal constraints over 16 iterations in 593 ms. Result :sat
Minimization took 156 ms.
[2024-05-24 08:23:17] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 08:23:17] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-24 08:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2024-05-24 08:23:17] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-24 08:23:18] [INFO ] [Nat]Added 112 Read/Feed constraints in 130 ms returned sat
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:23:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-24 08:23:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:23:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3905 ms
[2024-05-24 08:23:22] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2024-05-24 08:23:22] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-24 08:23:22] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2024-05-24 08:23:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 08:23:22] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 08:23:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 22 ms returned sat
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:22] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1140 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7, 6, 56, 7] Max Struct:[7, 8, 56, 7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 56 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:[7] Max Struct:[8]
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 79 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 250/266 places, 568/584 transitions.
[2024-05-24 08:23:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2024-05-24 08:23:23] [INFO ] Computed 82 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2501 ms. (399 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 688 ms. (1451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-05-24 08:23:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:27] [INFO ] Invariant cache hit.
[2024-05-24 08:23:27] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 08:23:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 08:23:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 08:23:27] [INFO ] [Real]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 08:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:27] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 08:23:27] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 08:23:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 29 ms returned sat
[2024-05-24 08:23:27] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 08:23:27] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 08:23:28] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:23:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2024-05-24 08:23:28] [INFO ] Added : 72 causal constraints over 15 iterations in 754 ms. Result :sat
Minimization took 105 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 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 08:23:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:28] [INFO ] Invariant cache hit.
[2024-05-24 08:23:28] [INFO ] Implicit Places using invariants in 316 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 320 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 348 ms. Remains : 242/250 places, 568/568 transitions.
[2024-05-24 08:23:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 08:23:28] [INFO ] Computed 74 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2256 ms. (443 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 678 ms. (1472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-05-24 08:23:31] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:31] [INFO ] Invariant cache hit.
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-24 08:23:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 08:23:31] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2024-05-24 08:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2024-05-24 08:23:32] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 24 ms.
[2024-05-24 08:23:33] [INFO ] Added : 150 causal constraints over 30 iterations in 896 ms. Result :sat
Minimization took 114 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, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 08:23:33] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:33] [INFO ] Invariant cache hit.
[2024-05-24 08:23:33] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-24 08:23:33] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:33] [INFO ] Invariant cache hit.
[2024-05-24 08:23:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 08:23:34] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-24 08:23:34] [INFO ] Redundant transitions in 37 ms returned []
Running 560 sub problems to find dead transitions.
[2024-05-24 08:23:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 08:23:34] [INFO ] Invariant cache hit.
[2024-05-24 08:23:34] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 74/316 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 3 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 10 places in 81 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
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 9 solved, 551 unsolved
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 21 solved, 539 unsolved
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 31 solved, 529 unsolved
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 35 solved, 525 unsolved
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 37 solved, 523 unsolved
[2024-05-24 08:23:51] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:23:52] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD480 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 43 solved, 517 unsolved
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 47 solved, 513 unsolved
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 47 solved, 513 unsolved
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:02] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:24:03] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:03] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-24 08:24:03] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:24:03] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:03] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
SMT process timed out in 30414ms, After SMT, problems are : Problem set: 47 solved, 513 unsolved
Search for dead transitions found 47 dead transitions in 30446ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 521/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-24 08:24:04] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31155 ms. Remains : 242/242 places, 521/568 transitions.
[2024-05-24 08:24:04] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
// Phase 1: matrix 368 rows 242 cols
[2024-05-24 08:24:04] [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 2169 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 659 ms. (1515 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-05-24 08:24:07] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:07] [INFO ] Invariant cache hit.
[2024-05-24 08:24:07] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 08:24:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-24 08:24:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:24:07] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2024-05-24 08:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:07] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 08:24:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-24 08:24:07] [INFO ] [Nat]Added 39 Read/Feed constraints in 9 ms returned sat
[2024-05-24 08:24:07] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 21 ms.
[2024-05-24 08:24:08] [INFO ] Added : 170 causal constraints over 34 iterations in 1076 ms. Result :sat
Minimization took 151 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, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-24 08:24:09] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:09] [INFO ] Invariant cache hit.
[2024-05-24 08:24:09] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-24 08:24:09] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:09] [INFO ] Invariant cache hit.
[2024-05-24 08:24:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:24:09] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-24 08:24:09] [INFO ] Redundant transitions in 6 ms returned []
Running 513 sub problems to find dead transitions.
[2024-05-24 08:24:09] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:09] [INFO ] Invariant cache hit.
[2024-05-24 08:24:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 20 places in 69 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, 513 unsolved
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 21 places in 73 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, 513 unsolved
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 33 places in 75 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, 513 unsolved
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 28 places in 79 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, 513 unsolved
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 28 places in 109 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, 513 unsolved
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 32 places in 86 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, 513 unsolved
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 36 places in 96 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, 513 unsolved
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:24:34] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-05-24 08:24:35] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:35] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-24 08:24:35] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:24:35] [INFO ] Deduced a trap composed of 36 places in 95 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, 513 unsolved
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30912 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 813 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 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
Interrupted probabilistic random walk after 588284 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 2
Probabilistic random walk after 588284 steps, saw 302343 distinct states, run finished after 3005 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-24 08:24:43] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:43] [INFO ] Invariant cache hit.
[2024-05-24 08:24:43] [INFO ] State equation strengthened by 39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 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/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 254 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 274 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 547ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 404 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 574745 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 2
Probabilistic random walk after 574745 steps, saw 296892 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
[2024-05-24 08:24:47] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:47] [INFO ] Invariant cache hit.
[2024-05-24 08:24:47] [INFO ] State equation strengthened by 39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 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/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 555 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-24 08:24:48] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:48] [INFO ] Invariant cache hit.
[2024-05-24 08:24:48] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-24 08:24:48] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:48] [INFO ] Invariant cache hit.
[2024-05-24 08:24:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:24:49] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-24 08:24:49] [INFO ] Redundant transitions in 3 ms returned []
Running 513 sub problems to find dead transitions.
[2024-05-24 08:24:49] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:24:49] [INFO ] Invariant cache hit.
[2024-05-24 08:24:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:24:55] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:55] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:24:56] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 20 places in 73 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, 513 unsolved
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 5 ms to minimize.
[2024-05-24 08:24:57] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:24:58] [INFO ] Deduced a trap composed of 21 places in 79 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, 513 unsolved
[2024-05-24 08:25:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:01] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 33 places in 90 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, 513 unsolved
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:25:02] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:03] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 28 places in 85 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, 513 unsolved
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:04] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:25:05] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:25:06] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:25:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:10] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 32 places in 93 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, 513 unsolved
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:11] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:12] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 36 places in 96 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, 513 unsolved
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:13] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:14] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-24 08:25:15] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2024-05-24 08:25:16] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-24 08:25:16] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:25:18] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:25:18] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:25:18] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:25:19] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30305ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30956 ms. Remains : 242/242 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 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 153 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 337 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 369 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 385 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 393 place count 98 transition count 344
Applied a total of 393 rules in 34 ms. Remains 98 /242 variables (removed 144) and now considering 344/521 (removed 177) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2024-05-24 08:25:19] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 08:25:19] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 08:25:19] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 08:25:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 08:25:20] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 08:25:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-24 08:25:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:25:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-24 08:25:20] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 08:25:20] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 503 ms.
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 08:25:20] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
// Phase 1: matrix 368 rows 242 cols
[2024-05-24 08:25:20] [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 29 ms. (333 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:[4] Max Struct:[8]
[2024-05-24 08:25:20] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:20] [INFO ] Invariant cache hit.
[2024-05-24 08:25:20] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2024-05-24 08:25:20] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-24 08:25:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:25:20] [INFO ] [Real]Added 39 Read/Feed constraints in 5 ms returned sat
[2024-05-24 08:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:25:20] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 08:25:20] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-24 08:25:20] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2024-05-24 08:25:20] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 24 ms.
[2024-05-24 08:25:21] [INFO ] Added : 68 causal constraints over 14 iterations in 379 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 17 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 242/242 places, 521/521 transitions.
[2024-05-24 08:25:21] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2315 ms. (431 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 712 ms. (1402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-05-24 08:25:24] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:24] [INFO ] Invariant cache hit.
[2024-05-24 08:25:24] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 08:25:24] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 08:25:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:25:24] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2024-05-24 08:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:25:24] [INFO ] [Nat]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 08:25:24] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 08:25:24] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2024-05-24 08:25:24] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 25 ms.
[2024-05-24 08:25:25] [INFO ] Added : 124 causal constraints over 25 iterations in 712 ms. Result :sat
Minimization took 223 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:[5] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-24 08:25:25] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:25] [INFO ] Invariant cache hit.
[2024-05-24 08:25:26] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 08:25:26] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:26] [INFO ] Invariant cache hit.
[2024-05-24 08:25:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:25:26] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-24 08:25:26] [INFO ] Redundant transitions in 3 ms returned []
Running 513 sub problems to find dead transitions.
[2024-05-24 08:25:26] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:25:26] [INFO ] Invariant cache hit.
[2024-05-24 08:25:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-24 08:25:33] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 20 places in 75 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, 513 unsolved
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:34] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:25:35] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:25:36] [INFO ] Deduced a trap composed of 21 places in 78 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, 513 unsolved
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:38] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 33 places in 78 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, 513 unsolved
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:25:39] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:40] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 28 places in 76 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, 513 unsolved
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:42] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:43] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:25:46] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:47] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 32 places in 93 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, 513 unsolved
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:25:48] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:25:49] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 36 places in 91 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, 513 unsolved
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 08:25:50] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:51] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-24 08:25:52] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:25:53] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-24 08:25:53] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 08:25:53] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:25:55] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:25:55] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:25:56] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31030 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 528559 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 2
Probabilistic random walk after 528559 steps, saw 274324 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-24 08:26:00] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:26:00] [INFO ] Invariant cache hit.
[2024-05-24 08:26:00] [INFO ] State equation strengthened by 39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 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/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 240 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 526 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 541554 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 2
Probabilistic random walk after 541554 steps, saw 280526 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-24 08:26:04] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:26:04] [INFO ] Invariant cache hit.
[2024-05-24 08:26:04] [INFO ] State equation strengthened by 39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 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/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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, 39/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 269 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 530 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-24 08:26:05] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:26:05] [INFO ] Invariant cache hit.
[2024-05-24 08:26:05] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-24 08:26:05] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:26:05] [INFO ] Invariant cache hit.
[2024-05-24 08:26:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 08:26:05] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-24 08:26:05] [INFO ] Redundant transitions in 3 ms returned []
Running 513 sub problems to find dead transitions.
[2024-05-24 08:26:05] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2024-05-24 08:26:05] [INFO ] Invariant cache hit.
[2024-05-24 08:26:05] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:26:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:13] [INFO ] Deduced a trap composed of 20 places in 79 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, 513 unsolved
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 08:26:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:26:15] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:15] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:26:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-24 08:26:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:26:15] [INFO ] Deduced a trap composed of 21 places in 70 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, 513 unsolved
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:26:17] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 3 ms to minimize.
[2024-05-24 08:26:18] [INFO ] Deduced a trap composed of 33 places in 88 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, 513 unsolved
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:19] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:20] [INFO ] Deduced a trap composed of 28 places in 79 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, 513 unsolved
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:26:21] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:26:22] [INFO ] Deduced a trap composed of 28 places in 99 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, 513 unsolved
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:26:25] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:26:26] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 32 places in 82 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, 513 unsolved
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:26:27] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:26:28] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:26:29] [INFO ] Deduced a trap composed of 36 places in 88 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, 513 unsolved
[2024-05-24 08:26:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:26:29] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:26:29] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:29] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:30] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:26:31] [INFO ] Deduced a trap composed of 36 places in 103 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, 513 unsolved
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:26:34] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:26:35] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:26:36] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 08:26:36] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:26:36] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 30300ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30964 ms. Remains : 242/242 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 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 153 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 337 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 369 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 385 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 393 place count 98 transition count 344
Applied a total of 393 rules in 20 ms. Remains 98 /242 variables (removed 144) and now considering 344/521 (removed 177) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2024-05-24 08:26:36] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 08:26:36] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 08:26:36] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 08:26:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-05-24 08:26:36] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 08:26:36] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 08:26:36] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 347 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[8]
Ending property specific reduction for LamportFastMutEx-PT-8-UpperBounds-05 in 76373 ms.
[2024-05-24 08:26:36] [INFO ] Flatten gal took : 90 ms
[2024-05-24 08:26:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 08:26:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 521 transitions and 2644 arcs took 6 ms.
Total runtime 226559 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-8

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 242
TRANSITIONS: 521
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]

SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3810
MODEL NAME: /home/mcc/execution/415/model
242 places, 521 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r223-tall-171649611200309"
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 ;