MCC'2024- Execution of r504-tall-171649612500306

About the Execution of LTSMin+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
844.136	204278.00	290552.00	506.40	?????????F??F???	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.r504-tall-171649612500306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LamportFastMutEx-PT-8, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612500306
=====================================================================

--------------------
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 6.6K May 18 16:42 GenericPropertiesVerdict.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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717227811195

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:43:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:43:32] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-01 07:43:32] [INFO ] Transformed 315 places.
[2024-06-01 07:43:32] [INFO ] Transformed 666 transitions.
[2024-06-01 07:43:32] [INFO ] Found NUPN structural information;
[2024-06-01 07:43:32] [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-06-01 07:43:32] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 82 transitions.
Support contains 266 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-06-01 07:43:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-06-01 07:43:32] [INFO ] Computed 82 invariants in 23 ms
[2024-06-01 07:43:33] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 07:43:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-06-01 07:43:33] [INFO ] Invariant cache hit.
[2024-06-01 07:43:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 07:43:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 07:43:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-06-01 07:43:33] [INFO ] Invariant cache hit.
[2024-06-01 07:43:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 82/348 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 17 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 7 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/368 constraints. Problems are: Problem set: 4 solved, 572 unsolved
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 6 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/388 constraints. Problems are: Problem set: 13 solved, 563 unsolved
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:43:43] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 5 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/408 constraints. Problems are: Problem set: 19 solved, 557 unsolved
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/428 constraints. Problems are: Problem set: 21 solved, 555 unsolved
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/448 constraints. Problems are: Problem set: 22 solved, 554 unsolved
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/468 constraints. Problems are: Problem set: 31 solved, 545 unsolved
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/488 constraints. Problems are: Problem set: 34 solved, 542 unsolved
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/508 constraints. Problems are: Problem set: 36 solved, 540 unsolved
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/528 constraints. Problems are: Problem set: 36 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/682 variables, and 528 constraints, problems are : Problem set: 36 solved, 540 unsolved in 30033 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 36 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 10/268 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 100/368 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/368 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 8/266 variables, 72/440 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 8/448 constraints. Problems are: Problem set: 36 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 80/528 constraints. Problems are: Problem set: 36 solved, 540 unsolved
[2024-06-01 07:44:07] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/548 constraints. Problems are: Problem set: 36 solved, 540 unsolved
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:11] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/568 constraints. Problems are: Problem set: 36 solved, 540 unsolved
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:44:12] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:44:13] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/588 constraints. Problems are: Problem set: 36 solved, 540 unsolved
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/608 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 20/628 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 20/648 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-06-01 07:44:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:44:23] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:24] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 20/668 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:44:25] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:44:25] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:44:25] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:44:25] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:44:26] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:44:27] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:44:27] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:44:27] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:44:27] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:44:28] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:44:28] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:44:28] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 20/688 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:44:29] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:44:29] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:29] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:29] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 20/708 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
SMT process timed out in 60456ms, After SMT, problems are : Problem set: 42 solved, 534 unsolved
Search for dead transitions found 42 dead transitions in 60478ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 542/584 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61020 ms. Remains : 266/266 places, 542/584 transitions.
Support contains 266 out of 266 places after structural reductions.
[2024-06-01 07:44:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:44:34] [INFO ] Flatten gal took : 102 ms
FORMULA LamportFastMutEx-PT-8-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:44:34] [INFO ] Flatten gal took : 64 ms
[2024-06-01 07:44:34] [INFO ] Input system was already deterministic with 542 transitions.
Reduction of identical properties reduced properties to check from 67 to 55
RANDOM walk for 40000 steps (8 resets) in 2887 ms. (13 steps per ms) remains 9/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 543 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
[2024-06-01 07:44:36] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-06-01 07:44:36] [INFO ] Computed 82 invariants in 4 ms
[2024-06-01 07:44:36] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 197/252 variables, 74/130 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 197/327 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
Problem AtomicPropp57 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 4/331 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 1/332 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/333 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 5/338 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/338 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 387/639 variables, 252/590 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 107/697 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:44:38] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:44:38] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 2/699 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/653 variables, 14/713 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/653 variables, 14/727 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 7/734 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 0/734 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/653 variables, 0/734 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 734 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2229 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/52 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 199/250 variables, 73/125 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 199/324 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 8/332 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:44:38] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:44:38] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 5/337 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/338 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/338 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 387/637 variables, 250/588 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 107/695 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 3/698 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/698 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/653 variables, 16/714 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/653 variables, 16/730 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/653 variables, 8/738 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 1/739 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 5/744 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/653 variables, 1/745 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/653 variables, 1/746 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 0/746 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 07:44:41] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/653 variables, 1/747 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/653 variables, 0/747 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 07:44:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:44:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/653 variables, 2/749 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/653 variables, 0/749 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/653 variables, 0/749 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 749 constraints, problems are : Problem set: 3 solved, 4 unsolved in 4309 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 24/24 constraints]
After SMT, in 6614ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 7502 ms.
Support contains 50 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 526
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 526
Applied a total of 32 rules in 78 ms. Remains 250 /266 variables (removed 16) and now considering 526/542 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 250/266 places, 526/542 transitions.
RANDOM walk for 40000 steps (8 resets) in 485 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/4 properties
[2024-06-01 07:44:50] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 250 cols
[2024-06-01 07:44:50] [INFO ] Computed 82 invariants in 4 ms
[2024-06-01 07:44:50] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/234 variables, 73/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 185/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:44:51] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:44:51] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:44:51] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 371/605 variables, 234/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 107/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/621 variables, 16/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 16/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/621 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 797 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/234 variables, 73/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 185/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 371/605 variables, 234/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 107/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/621 variables, 16/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 16/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 8/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:44:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/621 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/621 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 696 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1906 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2754ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2731 ms.
Support contains 49 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 250/250 places, 526/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 281 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 358552 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 3
Probabilistic random walk after 358552 steps, saw 190585 distinct states, run finished after 3005 ms. (steps per millisecond=119 ) properties seen :0
[2024-06-01 07:44:59] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-06-01 07:44:59] [INFO ] Invariant cache hit.
[2024-06-01 07:44:59] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/234 variables, 73/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 185/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 371/605 variables, 234/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 107/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/621 variables, 16/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 16/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 8/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/621 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 693 constraints, problems are : Problem set: 0 solved, 3 unsolved in 882 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/234 variables, 73/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 185/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 371/605 variables, 234/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 107/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/621 variables, 16/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 16/687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 8/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/621 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/621 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 697 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1879 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2798ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2702 ms.
Support contains 49 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 250/250 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 07:45:05] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-06-01 07:45:05] [INFO ] Invariant cache hit.
[2024-06-01 07:45:05] [INFO ] Implicit Places using invariants in 236 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 245 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 526/526 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 271 ms. Remains : 242/250 places, 526/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 421638 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 3
Probabilistic random walk after 421638 steps, saw 222207 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 07:45:08] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 242 cols
[2024-06-01 07:45:08] [INFO ] Computed 74 invariants in 7 ms
[2024-06-01 07:45:08] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 177/226 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 177/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:45:08] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:45:09] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:45:09] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 371/597 variables, 226/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 43/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/613 variables, 16/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 16/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 8/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/613 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 604 constraints, problems are : Problem set: 0 solved, 3 unsolved in 676 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 177/226 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 177/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:45:09] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:45:09] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 371/597 variables, 226/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 43/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 16/613 variables, 16/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 16/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/613 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/613 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/613 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 609 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1720 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2441ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2258 ms.
Support contains 49 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-06-01 07:45:13] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-06-01 07:45:13] [INFO ] Invariant cache hit.
[2024-06-01 07:45:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 07:45:13] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-06-01 07:45:13] [INFO ] Invariant cache hit.
[2024-06-01 07:45:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:45:13] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-06-01 07:45:13] [INFO ] Redundant transitions in 29 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 07:45:13] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-06-01 07:45:13] [INFO ] Invariant cache hit.
[2024-06-01 07:45:13] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:45:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:45:20] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:45:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:45:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 10 places in 39 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, 518 unsolved
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:45:22] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:45:23] [INFO ] Deduced a trap composed of 13 places in 72 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, 518 unsolved
[2024-06-01 07:45:25] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:45:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:45:25] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:45:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 26 places in 95 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, 518 unsolved
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 2 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/613 variables, and 476 constraints, problems are : Problem set: 2 solved, 516 unsolved in 30019 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 2 solved, 516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 107/351 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/351 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 8/242 variables, 64/415 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/423 constraints. Problems are: Problem set: 2 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 53/476 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:45:48] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:45:49] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/496 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:45:52] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/516 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:45:55] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:45:56] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/536 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-06-01 07:45:56] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:45:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:45:58] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/556 constraints. Problems are: Problem set: 6 solved, 512 unsolved
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:46:01] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/576 constraints. Problems are: Problem set: 6 solved, 512 unsolved
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:02] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/596 constraints. Problems are: Problem set: 6 solved, 512 unsolved
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 20/616 constraints. Problems are: Problem set: 6 solved, 512 unsolved
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 20/636 constraints. Problems are: Problem set: 6 solved, 512 unsolved
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 20/656 constraints. Problems are: Problem set: 6 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/613 variables, and 656 constraints, problems are : Problem set: 6 solved, 512 unsolved in 30020 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 340/340 constraints]
After SMT, in 60286ms problems are : Problem set: 6 solved, 512 unsolved
Search for dead transitions found 6 dead transitions in 60291ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 520/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-06-01 07:46:14] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60887 ms. Remains : 242/242 places, 520/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 320944 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 3
Probabilistic random walk after 320944 steps, saw 171631 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 07:46:17] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2024-06-01 07:46:17] [INFO ] Computed 74 invariants in 2 ms
[2024-06-01 07:46:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 177/226 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 177/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:46:17] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:46:17] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:18] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 368/594 variables, 226/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 40/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/610 variables, 16/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 16/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/610 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 601 constraints, problems are : Problem set: 0 solved, 3 unsolved in 646 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 177/226 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 177/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:46:18] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:46:18] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 368/594 variables, 226/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 40/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 16/610 variables, 16/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 16/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/610 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/610 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:46:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/610 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/610 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2224 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 2906ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 980 ms.
Support contains 49 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-06-01 07:46:21] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-06-01 07:46:21] [INFO ] Invariant cache hit.
[2024-06-01 07:46:21] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 07:46:21] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-06-01 07:46:21] [INFO ] Invariant cache hit.
[2024-06-01 07:46:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:46:22] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-01 07:46:22] [INFO ] Redundant transitions in 4 ms returned []
Running 512 sub problems to find dead transitions.
[2024-06-01 07:46:22] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2024-06-01 07:46:22] [INFO ] Invariant cache hit.
[2024-06-01 07:46:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:46:28] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:46:29] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:46:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:35] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:36] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:41] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:41] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:46:42] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:43] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 9 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:46:44] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:46:51] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:46:52] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:46:52] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:46:52] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
SMT process timed out in 30241ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30800 ms. Remains : 242/242 places, 520/520 transitions.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2024-06-01 07:46:52] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:46:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-8-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:46:52] [INFO ] Flatten gal took : 52 ms
[2024-06-01 07:46:52] [INFO ] Input system was already deterministic with 542 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:52] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 23 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:46:53] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:46:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:46:54] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 266/266 places, 542/542 transitions.
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:46:54] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Applied a total of 16 rules in 23 ms. Remains 258 /266 variables (removed 8) and now considering 534/542 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 258/266 places, 534/542 transitions.
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:46:54] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Applied a total of 16 rules in 18 ms. Remains 258 /266 variables (removed 8) and now considering 534/542 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 258/266 places, 534/542 transitions.
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:46:54] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 259 transition count 535
Applied a total of 14 rules in 17 ms. Remains 259 /266 variables (removed 7) and now considering 535/542 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 259/266 places, 535/542 transitions.
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:46:54] [INFO ] Input system was already deterministic with 535 transitions.
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:46:54] [INFO ] Flatten gal took : 48 ms
[2024-06-01 07:46:54] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 37 ms.
[2024-06-01 07:46:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 542 transitions and 2392 arcs took 5 ms.
Total runtime 202539 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-00
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-01
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-02
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-03
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-04
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-05
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-06
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-07
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-08
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-10
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-11
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-13
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-14
Could not compute solution for formula : LamportFastMutEx-PT-8-CTLFireability-2024-15

BK_STOP 1717228015473

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/3395/ctl_0_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/3395/ctl_1_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/3395/ctl_2_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/3395/ctl_3_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/3395/ctl_4_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/3395/ctl_5_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/3395/ctl_6_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/3395/ctl_7_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/3395/ctl_8_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/3395/ctl_9_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/3395/ctl_10_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/3395/ctl_11_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/3395/ctl_12_
ctl formula name LamportFastMutEx-PT-8-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/3395/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-PT-8, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612500306"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;