Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611100297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-PT-7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611100297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 20K Apr 13 07:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 13 07:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 13 07:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 199K Apr 13 07:35 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 19K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 13 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 13 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K 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 265K 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-7-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716534838152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 07:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 07:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:13:59] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-24 07:13:59] [INFO ] Transformed 264 places.
[2024-05-24 07:13:59] [INFO ] Transformed 536 transitions.
[2024-05-24 07:13:59] [INFO ] Found NUPN structural information;
[2024-05-24 07:13:59] [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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, 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_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]
[2024-05-24 07:13:59] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 74 transitions.
Support contains 195 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-05-24 07:13:59] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2024-05-24 07:13:59] [INFO ] Computed 65 invariants in 16 ms
[2024-05-24 07:13:59] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-24 07:13:59] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-05-24 07:13:59] [INFO ] Invariant cache hit.
[2024-05-24 07:14:00] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-24 07:14:00] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-05-24 07:14:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-05-24 07:14:00] [INFO ] Invariant cache hit.
[2024-05-24 07:14:00] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 65/284 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-24 07:14:02] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 28 ms to minimize.
[2024-05-24 07:14:02] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 2 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-24 07:14:03] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/304 constraints. Problems are: Problem set: 8 solved, 447 unsolved
[2024-05-24 07:14:04] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 3 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:05] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 5 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:06] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/324 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:14:08] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:09] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/344 constraints. Problems are: Problem set: 17 solved, 438 unsolved
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-24 07:14:10] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/364 constraints. Problems are: Problem set: 22 solved, 433 unsolved
[2024-05-24 07:14:11] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:14:13] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/384 constraints. Problems are: Problem set: 24 solved, 431 unsolved
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 07:14:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:16] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/404 constraints. Problems are: Problem set: 30 solved, 425 unsolved
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:17] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:18] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/424 constraints. Problems are: Problem set: 32 solved, 423 unsolved
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:19] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-24 07:14:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/444 constraints. Problems are: Problem set: 34 solved, 421 unsolved
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:23] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/464 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-05-24 07:14:24] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:25] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:26] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/484 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:27] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:28] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/504 constraints. Problems are: Problem set: 36 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/555 variables, and 504 constraints, problems are : Problem set: 36 solved, 419 unsolved in 30023 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 36 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 9/221 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 151/372 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/372 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 56/428 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 7/435 constraints. Problems are: Problem set: 36 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 69/504 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:34] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:35] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/524 constraints. Problems are: Problem set: 38 solved, 417 unsolved
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:36] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 4 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-24 07:14:37] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/544 constraints. Problems are: Problem set: 38 solved, 417 unsolved
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:39] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:40] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/564 constraints. Problems are: Problem set: 38 solved, 417 unsolved
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:41] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/584 constraints. Problems are: Problem set: 38 solved, 417 unsolved
[2024-05-24 07:14:43] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-24 07:14:43] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-24 07:14:43] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-24 07:14:43] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-24 07:14:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:44] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:45] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:14:45] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:45] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/604 constraints. Problems are: Problem set: 38 solved, 417 unsolved
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:46] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:47] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/624 constraints. Problems are: Problem set: 40 solved, 415 unsolved
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:48] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:49] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:50] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:50] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:50] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:50] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-24 07:14:50] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 20/644 constraints. Problems are: Problem set: 40 solved, 415 unsolved
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:51] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-24 07:14:53] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/664 constraints. Problems are: Problem set: 40 solved, 415 unsolved
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 07:14:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-24 07:14:55] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-24 07:14:56] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:14:56] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/684 constraints. Problems are: Problem set: 40 solved, 415 unsolved
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:57] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-24 07:14:58] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 20/704 constraints. Problems are: Problem set: 40 solved, 415 unsolved
[2024-05-24 07:14:59] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:14:59] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-24 07:14:59] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:15:00] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/555 variables, and 714 constraints, problems are : Problem set: 40 solved, 415 unsolved in 30012 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 0/455 constraints, Known Traps: 430/430 constraints]
After SMT, in 60353ms problems are : Problem set: 40 solved, 415 unsolved
Search for dead transitions found 40 dead transitions in 60380ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 422/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60969 ms. Remains : 219/219 places, 422/462 transitions.
Support contains 195 out of 219 places after structural reductions.
[2024-05-24 07:15:00] [INFO ] Flatten gal took : 57 ms
[2024-05-24 07:15:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 07:15:00] [INFO ] Flatten gal took : 28 ms
[2024-05-24 07:15:00] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 194 out of 219 places (down from 195) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 58 to 57
RANDOM walk for 40000 steps (8 resets) in 2287 ms. (17 steps per ms) remains 18/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2024-05-24 07:15:01] [INFO ] Flow matrix only has 309 transitions (discarded 113 similar events)
// Phase 1: matrix 309 rows 219 cols
[2024-05-24 07:15:01] [INFO ] Computed 65 invariants in 8 ms
[2024-05-24 07:15:01] [INFO ] State equation strengthened by 85 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 56/189 variables, 56/189 constraints. Problems are: Problem set: 17 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 56/245 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 309/498 variables, 189/434 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 85/519 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/519 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/528 variables, 30/549 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 30/579 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 9/588 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/588 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/528 variables, 0/588 constraints. Problems are: Problem set: 17 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 588 constraints, problems are : Problem set: 17 solved, 1 unsolved in 208 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 133/182 variables, 49/98 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 133/231 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/231 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/189 variables, 7/238 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 7/245 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 309/498 variables, 189/434 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 85/519 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/519 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/528 variables, 30/549 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 30/579 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 9/588 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/589 constraints. Problems are: Problem set: 17 solved, 1 unsolved
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-24 07:15:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 07:15:03] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 07:15:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 07:15:03] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-24 07:15:03] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 12/601 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/601 constraints. Problems are: Problem set: 17 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/528 variables, 0/601 constraints. Problems are: Problem set: 17 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 601 constraints, problems are : Problem set: 17 solved, 1 unsolved in 1126 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/18 constraints, Known Traps: 12/12 constraints]
After SMT, in 1390ms problems are : Problem set: 17 solved, 1 unsolved
Finished Parikh walk after 5596 steps, including 225 resets, run visited all 1 properties in 24 ms. (steps per millisecond=233 )
Parikh walk visited 1 properties in 35 ms.
Successfully simplified 17 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 07:15:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 24 ms
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 36 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 148 out of 219 places (down from 159) after GAL structural reductions.
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 19 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 19 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 422/422 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 212 transition count 415
Applied a total of 14 rules in 40 ms. Remains 212 /219 variables (removed 7) and now considering 415/422 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 212/219 places, 415/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 16 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 17 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 16 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 17 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 15 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 15 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 16 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 13 ms
[2024-05-24 07:15:03] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:15:03] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 13 ms
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:15:04] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 216 transition count 419
Applied a total of 6 rules in 21 ms. Remains 216 /219 variables (removed 3) and now considering 419/422 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 216/219 places, 419/422 transitions.
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 13 ms
[2024-05-24 07:15:04] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 422/422 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 219/219 places, 422/422 transitions.
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 13 ms
[2024-05-24 07:15:04] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 422/422 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 212 transition count 415
Applied a total of 14 rules in 19 ms. Remains 212 /219 variables (removed 7) and now considering 415/422 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 212/219 places, 415/422 transitions.
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 13 ms
[2024-05-24 07:15:04] [INFO ] Input system was already deterministic with 415 transitions.
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 07:15:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 07:15:04] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-24 07:15:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 422 transitions and 1856 arcs took 4 ms.
Total runtime 65097 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-7

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1875
MODEL NAME: /home/mcc/execution/403/model
219 places, 422 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-PT-7, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611100297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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