Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435800086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is LamportFastMutEx-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 404K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 208K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748775980304

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:06:21] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-01 11:06:21] [INFO ] Transformed 217 places.
[2025-06-01 11:06:21] [INFO ] Transformed 420 transitions.
[2025-06-01 11:06:21] [INFO ] Found NUPN structural information;
[2025-06-01 11:06:21] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2025-06-01 11:06:21] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
FORMULA LamportFastMutEx-PT-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-07 1 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, 1, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-6-UpperBounds-11 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] Max Struct:[6, 6, 6, 6, 6, 36, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 11:06:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2025-06-01 11:06:21] [INFO ] Computed 50 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 56 ms. (175 steps per ms)
FORMULA LamportFastMutEx-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 72 ms. (685 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 5, 4, 30] Max Struct:[6, 6, 6, 6, 36]
[2025-06-01 11:06:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-01 11:06:21] [INFO ] Invariant cache hit.
[2025-06-01 11:06:22] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2025-06-01 11:06:22] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 11:06:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 11:06:22] [INFO ] [Real]Added 72 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:06:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:22] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 11:06:22] [INFO ] [Nat]Added 72 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 7 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 855 ms
[2025-06-01 11:06:23] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:06:23] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 11:06:23] [INFO ] [Real]Added 72 Read/Feed constraints in 13 ms returned sat
[2025-06-01 11:06:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:23] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:06:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 639 ms
[2025-06-01 11:06:24] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:06:24] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 11:06:24] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:06:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2025-06-01 11:06:24] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:06:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 817 ms
[2025-06-01 11:06:25] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:06:25] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:06:25] [INFO ] [Real]Added 72 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:06:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2025-06-01 11:06:25] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 11:06:25] [INFO ] [Nat]Added 72 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:06:25] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 35 ms.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-06-01 11:06:25] [INFO ] Added : 46 causal constraints over 10 iterations in 339 ms. Result :sat
Minimization took 100 ms.
[2025-06-01 11:06:25] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:06:25] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:06:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:26] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 11:06:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 31 ms returned sat
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 979 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 5, 4, 30] Max Struct:[5, 5, 5, 6, 30]
FORMULA LamportFastMutEx-PT-6-UpperBounds-05 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 55 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 164/176 places, 342/354 transitions.
[2025-06-01 11:06:27] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2025-06-01 11:06:27] [INFO ] Computed 50 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1924 ms. (519 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 588 ms. (1697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-01 11:06:29] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:29] [INFO ] Invariant cache hit.
[2025-06-01 11:06:29] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:06:29] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 11:06:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 11:06:29] [INFO ] [Real]Added 72 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:06:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:06:30] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 11:06:30] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2025-06-01 11:06:30] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 21 ms.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 6 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 444 ms
[2025-06-01 11:06:30] [INFO ] Added : 74 causal constraints over 15 iterations in 748 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 23 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2025-06-01 11:06:31] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:31] [INFO ] Invariant cache hit.
[2025-06-01 11:06:31] [INFO ] Implicit Places using invariants in 159 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 161 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 182 ms. Remains : 158/164 places, 342/342 transitions.
[2025-06-01 11:06:31] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2025-06-01 11:06:31] [INFO ] Computed 44 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1794 ms. (557 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 583 ms. (1712 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-01 11:06:33] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:33] [INFO ] Invariant cache hit.
[2025-06-01 11:06:33] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2025-06-01 11:06:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-01 11:06:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-01 11:06:33] [INFO ] [Real]Added 36 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:06:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2025-06-01 11:06:33] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 11:06:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:06:33] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 18 ms.
[2025-06-01 11:06:34] [INFO ] Added : 99 causal constraints over 20 iterations in 413 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2025-06-01 11:06:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:34] [INFO ] Invariant cache hit.
[2025-06-01 11:06:34] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 11:06:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:34] [INFO ] Invariant cache hit.
[2025-06-01 11:06:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-01 11:06:34] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2025-06-01 11:06:34] [INFO ] Redundant transitions in 23 ms returned []
Running 336 sub problems to find dead transitions.
[2025-06-01 11:06:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2025-06-01 11:06:34] [INFO ] Invariant cache hit.
[2025-06-01 11:06:34] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 44/202 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 68 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
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/222 constraints. Problems are: Problem set: 6 solved, 330 unsolved
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/242 constraints. Problems are: Problem set: 17 solved, 319 unsolved
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/262 constraints. Problems are: Problem set: 29 solved, 307 unsolved
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/282 constraints. Problems are: Problem set: 35 solved, 301 unsolved
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:06:42] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:06:43] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/302 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/322 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:46] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/342 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 3 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/362 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/382 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:53] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/402 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/422 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/442 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/462 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/410 variables, and 464 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30028 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/158 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 262/262 constraints]
Escalating to Integer solving :Problem set: 36 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 8/160 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 150/310 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/310 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 6/158 variables, 36/346 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 6/352 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 112/464 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 0 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/484 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/504 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/524 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/544 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/564 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/584 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/604 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/624 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 20/644 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/410 variables, and 644 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30017 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/158 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 0/336 constraints, Known Traps: 442/442 constraints]
After SMT, in 60215ms problems are : Problem set: 36 solved, 300 unsolved
Search for dead transitions found 36 dead transitions in 60227ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/158 places, 306/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-01 11:07:35] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60651 ms. Remains : 158/158 places, 306/342 transitions.
[2025-06-01 11:07:35] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2025-06-01 11:07:35] [INFO ] Computed 44 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[6]
FORMULA LamportFastMutEx-PT-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1613 ms. (619 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 11:07:36] [INFO ] Flatten gal took : 56 ms
[2025-06-01 11:07:36] [INFO ] Flatten gal took : 23 ms
[2025-06-01 11:07:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10527548229654337135.gal : 13 ms
[2025-06-01 11:07:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16325383575917960538.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10527548229654337135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16325383575917960538.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 75536 ms.

BK_STOP 1748776056999

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is LamportFastMutEx-PT-6, 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 r125-tall-174876435800086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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