Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 17K Apr 13 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 07:43 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 7.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 222K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 114K 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-4-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716570155147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 17:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 17:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:02:36] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-24 17:02:36] [INFO ] Transformed 135 places.
[2024-05-24 17:02:36] [INFO ] Transformed 230 transitions.
[2024-05-24 17:02:36] [INFO ] Found NUPN structural information;
[2024-05-24 17:02:36] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2024-05-24 17:02:36] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:02:36] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 17:02:36] [INFO ] Computed 26 invariants in 9 ms
[2024-05-24 17:02:36] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-24 17:02:36] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:02:36] [INFO ] Invariant cache hit.
[2024-05-24 17:02:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 17:02:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 17:02:36] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:02:36] [INFO ] Invariant cache hit.
[2024-05-24 17:02:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 26/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 17:02:37] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 13 ms to minimize.
[2024-05-24 17:02:37] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
[2024-05-24 17:02:37] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:02:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 19 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 6 solved, 170 unsolved
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:02:38] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:02:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 12 solved, 164 unsolved
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:02:40] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:41] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:44] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/240 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/244 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:02:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:02:47] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:47] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/260 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:47] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:48] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:02:48] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 4/264 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:48] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/265 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:48] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:02:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/276 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 1/277 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:51] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:02:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:02:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:02:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/282 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:02:52] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:02:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:02:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 3/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 144/246 variables, 102/387 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 40/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 427 constraints, problems are : Problem set: 24 solved, 152 unsolved in 21671 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 157/157 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 87/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/211 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 70/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:00] [INFO ] Deduced a trap composed of 27 places in 333 ms of which 1 ms to minimize.
[2024-05-24 17:03:00] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:03:00] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:03:00] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 5/290 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/294 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:01] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 5/299 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:02] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/301 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:03:03] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 4/305 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:03] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:04] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:03:04] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/308 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:05] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:05] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:03:05] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/313 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 1/314 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:03:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (OVERLAPS) 144/246 variables, 102/418 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 40/458 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 152/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/246 variables, 0/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:15] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/246 variables, 1/611 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:03:19] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 2/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:03:26] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/246 variables, 1/614 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 614 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30021 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 192/192 constraints]
After SMT, in 51832ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 51847ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52220 ms. Remains : 102/102 places, 156/180 transitions.
Support contains 98 out of 102 places after structural reductions.
[2024-05-24 17:03:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 17:03:28] [INFO ] Flatten gal took : 38 ms
[2024-05-24 17:03:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 17:03:29] [INFO ] Flatten gal took : 20 ms
[2024-05-24 17:03:29] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 97 out of 102 places (down from 98) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 29
RANDOM walk for 40000 steps (8 resets) in 1494 ms. (26 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
[2024-05-24 17:03:29] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-05-24 17:03:29] [INFO ] Computed 26 invariants in 2 ms
[2024-05-24 17:03:29] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (OVERLAPS) 84/100 variables, 25/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 84/125 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 5/130 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/132 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/132 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/228 variables, 100/232 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 36/268 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/230 variables, 2/270 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 2/272 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 1/273 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 273 constraints, problems are : Problem set: 4 solved, 1 unsolved in 418 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/43 variables, 9/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 38/52 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/49 variables, 3/55 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 6/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 80/129 variables, 49/110 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 16/126 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/126 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/166 variables, 15/141 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 15/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 2/158 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 8/166 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 1/167 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 1/168 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 17:03:30] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 2/170 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/166 variables, 0/170 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 34/200 variables, 10/180 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/200 variables, 34/214 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/200 variables, 2/216 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/200 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/230 variables, 38/254 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/230 variables, 4/258 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/230 variables, 2/260 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/230 variables, 12/272 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/230 variables, 4/276 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/230 variables, 0/276 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/230 variables, 0/276 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 276 constraints, problems are : Problem set: 4 solved, 1 unsolved in 183 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 619ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 99 transition count 153
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 99 transition count 150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 96 transition count 150
Applied a total of 12 rules in 24 ms. Remains 96 /102 variables (removed 6) and now considering 150/156 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 96/102 places, 150/156 transitions.
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1955468 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :0 out of 1
Probabilistic random walk after 1955468 steps, saw 433157 distinct states, run finished after 3004 ms. (steps per millisecond=650 ) properties seen :0
[2024-05-24 17:03:33] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
// Phase 1: matrix 122 rows 96 cols
[2024-05-24 17:03:33] [INFO ] Computed 26 invariants in 4 ms
[2024-05-24 17:03:33] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/125 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/162 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/192 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 30/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 26/218 variables, 34/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 12/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/218 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/125 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/162 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:03:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:03:33] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 30/192 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/192 variables, 30/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/192 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/218 variables, 34/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/218 variables, 12/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/218 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-24 17:03:34] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
[2024-05-24 17:03:34] [INFO ] Invariant cache hit.
[2024-05-24 17:03:34] [INFO ] Implicit Places using invariants in 88 ms returned [64, 65, 66]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/96 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102 ms. Remains : 93/96 places, 150/150 transitions.
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1879307 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :0 out of 1
Probabilistic random walk after 1879307 steps, saw 417561 distinct states, run finished after 3001 ms. (steps per millisecond=626 ) properties seen :0
[2024-05-24 17:03:37] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
// Phase 1: matrix 122 rows 93 cols
[2024-05-24 17:03:37] [INFO ] Computed 23 invariants in 3 ms
[2024-05-24 17:03:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 35/40 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/46 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/124 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/161 variables, 15/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 28/189 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 28/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 26/215 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/215 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/215 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/215 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 35/40 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/46 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/124 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/161 variables, 15/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:03:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/189 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/189 variables, 28/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/215 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/215 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/215 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/215 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/215 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/215 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-24 17:03:37] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
[2024-05-24 17:03:37] [INFO ] Invariant cache hit.
[2024-05-24 17:03:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 17:03:37] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
[2024-05-24 17:03:37] [INFO ] Invariant cache hit.
[2024-05-24 17:03:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 17:03:37] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-24 17:03:37] [INFO ] Redundant transitions in 3 ms returned []
Running 146 sub problems to find dead transitions.
[2024-05-24 17:03:37] [INFO ] Flow matrix only has 122 transitions (discarded 28 similar events)
[2024-05-24 17:03:37] [INFO ] Invariant cache hit.
[2024-05-24 17:03:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:03:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:03:39] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 6 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 15/191 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:03:43] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 13/204 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:03:44] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 17/221 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 13/234 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:03:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/93 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:50] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:03:51] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:03:51] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/93 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/93 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 19 (OVERLAPS) 122/215 variables, 93/357 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:03:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/215 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 23 (OVERLAPS) 0/215 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 382 constraints, problems are : Problem set: 0 solved, 146 unsolved in 20487 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 98/193 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 4/93 variables, 17/210 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 51/265 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 122/215 variables, 93/358 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 24/382 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 146/528 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:04:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:04:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:04:03] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:04:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:04:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:06] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:04:08] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:04:08] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:04:11] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:04:11] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-24 17:04:15] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 17 (OVERLAPS) 0/215 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 544 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25636 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 165/165 constraints]
After SMT, in 46173ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 46176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46407 ms. Remains : 93/93 places, 150/150 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 93 transition count 122
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 28 place count 93 transition count 107
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 70 place count 66 transition count 107
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 84 place count 59 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 98 place count 52 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 52 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 51 transition count 117
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 51 transition count 117
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 51 transition count 117
Applied a total of 105 rules in 41 ms. Remains 51 /93 variables (removed 42) and now considering 117/150 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 51 cols
[2024-05-24 17:04:24] [INFO ] Computed 11 invariants in 0 ms
[2024-05-24 17:04:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 17:04:24] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 17:04:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 17:04:24] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 17:04:24] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 17:04:24] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 12 ms
[2024-05-24 17:04:24] [INFO ] Input system was already deterministic with 156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 9 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2024-05-24 17:04:24] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2024-05-24 17:04:24] [INFO ] Computed 26 invariants in 1 ms
[2024-05-24 17:04:24] [INFO ] Implicit Places using invariants in 105 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 6 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2024-05-24 17:04:24] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2024-05-24 17:04:24] [INFO ] Computed 22 invariants in 0 ms
[2024-05-24 17:04:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 17:04:24] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 17:04:24] [INFO ] Invariant cache hit.
[2024-05-24 17:04:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 17:04:24] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 376 ms. Remains : 90/102 places, 148/156 transitions.
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 16 ms
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 20 ms
[2024-05-24 17:04:24] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 17:04:24] [INFO ] Flatten gal took : 8 ms
[2024-05-24 17:04:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9339370411217051209.gal : 4 ms
[2024-05-24 17:04:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12323030967379270174.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9339370411217051209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12323030967379270174.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4985e+06,2.17326,67576,2,12452,5,225646,6,0,510,275015,0


Converting to forward existential form...Done !
original formula: AG(EF((EG(((((y_0==0)||(P_awaity_2==0))&&((y_0==0)||(P_awaity_3==0)))&&(((y_0==0)||(P_awaity_4==0))&&((y_0==0)||(P_awaity_1==0))))) * (((...275
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (EG(((((y_0==0)||(P_awaity_2==0))&&((y_0==0)||(P_awaity_3==0)))&&(((y_0==0)||(P_a...335
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...660
Detected timeout of ITS tools.
[2024-05-24 17:04:54] [INFO ] Flatten gal took : 13 ms
[2024-05-24 17:04:54] [INFO ] Applying decomposition
[2024-05-24 17:04:54] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16401547799937265943.txt' '-o' '/tmp/graph16401547799937265943.bin' '-w' '/tmp/graph16401547799937265943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16401547799937265943.bin' '-l' '-1' '-v' '-w' '/tmp/graph16401547799937265943.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:04:55] [INFO ] Decomposing Gal with order
[2024-05-24 17:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:04:55] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-24 17:04:55] [INFO ] Flatten gal took : 42 ms
[2024-05-24 17:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 9 ms.
[2024-05-24 17:04:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6487961222149233549.gal : 4 ms
[2024-05-24 17:04:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8537832051928432288.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6487961222149233549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8537832051928432288.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4985e+06,15.7793,330448,2832,441,316962,4229,399,2.75327e+06,102,30310,0


Converting to forward existential form...Done !
original formula: AG(EF((EG(((((i5.u0.y_0==0)||(i0.u14.P_awaity_2==0))&&((i5.u0.y_0==0)||(i4.u15.P_awaity_3==0)))&&(((i5.u0.y_0==0)||(i1.u16.P_awaity_4==0)...375
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (EG(((((i5.u0.y_0==0)||(i0.u14.P_awaity_2==0))&&((i5.u0.y_0==0)||(i4.u15.P_awaity...435
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t48, t56, t63, t100, t110, t115, t119, t125, t127, t1...579
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:05:25] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-05-24 17:05:25] [INFO ] Computed 26 invariants in 2 ms
[2024-05-24 17:05:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 17:05:25] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:05:25] [INFO ] Invariant cache hit.
[2024-05-24 17:05:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 17:05:25] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-24 17:05:25] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:05:25] [INFO ] Invariant cache hit.
[2024-05-24 17:05:25] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/102 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 128/230 variables, 102/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:43] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 17:05:43] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:45] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 25 (OVERLAPS) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 420 constraints, problems are : Problem set: 0 solved, 152 unsolved in 25060 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 154/154 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 55/282 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:05:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:05:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:54] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:05:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 128/230 variables, 102/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 152/607 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:06:00] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:06:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:09] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/230 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 615 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30010 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 197/197 constraints]
After SMT, in 55139ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 55140ms
Finished structural reductions in LTL mode , in 1 iterations and 55474 ms. Remains : 102/102 places, 156/156 transitions.
[2024-05-24 17:06:20] [INFO ] Flatten gal took : 10 ms
[2024-05-24 17:06:20] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:06:20] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:06:20] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:06:20] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:06:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9257137558911741662.gal : 2 ms
[2024-05-24 17:06:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9767582553411680703.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9257137558911741662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9767582553411680703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.96593,89652,2,15570,5,254562,6,0,566,359392,0


Converting to forward existential form...Done !
original formula: EF((EG(((((((P_await_13_2==1)&&(P_done_2_1==1))&&((P_done_2_2==1)&&(P_done_2_3==1)))&&(P_done_2_4==1))||((((P_await_13_3==1)&&(P_done_3_1...629
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((((((P_await_13_2==1)&&(P_done_2_1==1))&&((P_done_2_2==1)&&(P_done_2_3==1)))&&(P_done_2_...1003
Hit Full ! (commute/partial/dont) 132/0/24
(forward)formula 0,1,9.81758,218756,1,0,13,912064,19,1,3004,880463,13
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 13 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2024-05-24 17:06:30] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2024-05-24 17:06:30] [INFO ] Computed 26 invariants in 3 ms
[2024-05-24 17:06:30] [INFO ] Implicit Places using invariants in 70 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 94/102 places, 152/156 transitions.
[2024-05-24 17:06:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:06:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:06:30] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-24 17:06:30] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:06:30] [INFO ] Flatten gal took : 8 ms
[2024-05-24 17:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16495963688196341667.gal : 1 ms
[2024-05-24 17:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14244632541900577484.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16495963688196341667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14244632541900577484.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67273e+06,1.8337,57916,2,10720,5,180160,6,0,530,239913,0


Converting to forward existential form...Done !
original formula: EF((((((((y_2==1)&&(P_ifyi_15_1==1))||((y_2==1)&&(P_ifyi_15_3==1)))||(((y_0==1)&&(P_ifyi_15_4==1))||((y_0==1)&&(P_ifyi_15_3==1))))||((((y...1623
=> equivalent forward existential formula: ((([(((FwdU(Init,TRUE) * ((((((y_2==1)&&(P_ifyi_15_1==1))||((y_2==1)&&(P_ifyi_15_3==1)))||(((y_0==1)&&(P_ifyi_15...4611
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:07:00] [INFO ] Flatten gal took : 10 ms
[2024-05-24 17:07:00] [INFO ] Applying decomposition
[2024-05-24 17:07:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12143196130902078489.txt' '-o' '/tmp/graph12143196130902078489.bin' '-w' '/tmp/graph12143196130902078489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12143196130902078489.bin' '-l' '-1' '-v' '-w' '/tmp/graph12143196130902078489.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:07:00] [INFO ] Decomposing Gal with order
[2024-05-24 17:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:07:00] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-24 17:07:00] [INFO ] Flatten gal took : 15 ms
[2024-05-24 17:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2024-05-24 17:07:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8495056299677683261.gal : 3 ms
[2024-05-24 17:07:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6020111093014597684.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8495056299677683261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6020111093014597684.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67273e+06,10.1937,237076,5882,179,324222,1047,370,1.3608e+06,75,9077,0


Converting to forward existential form...Done !
original formula: EF((((((((i4.u8.y_2==1)&&(i0.u30.P_ifyi_15_1==1))||((i4.u8.y_2==1)&&(i1.u32.P_ifyi_15_3==1)))||(((i4.u8.y_0==1)&&(i2.u29.P_ifyi_15_4==1))...2197
=> equivalent forward existential formula: ((([(((FwdU(Init,TRUE) * ((((((i4.u8.y_2==1)&&(i0.u30.P_ifyi_15_1==1))||((i4.u8.y_2==1)&&(i1.u32.P_ifyi_15_3==1)...6259
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t48, t60, t96, t97, t98, t99, t100, t101, t102, t103,...573
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:07:30] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-05-24 17:07:30] [INFO ] Computed 26 invariants in 4 ms
[2024-05-24 17:07:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 17:07:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:07:31] [INFO ] Invariant cache hit.
[2024-05-24 17:07:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 17:07:31] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-24 17:07:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:07:31] [INFO ] Invariant cache hit.
[2024-05-24 17:07:31] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:07:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2024-05-24 17:07:38] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:40] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:07:42] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:43] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/102 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 128/230 variables, 102/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 25 (OVERLAPS) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 420 constraints, problems are : Problem set: 0 solved, 152 unsolved in 25131 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 154/154 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 55/282 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:07:59] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:08:00] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:08:00] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:00] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:08:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:08:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:02] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:08:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 128/230 variables, 102/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 152/607 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:06] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:08:15] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:08:15] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:08:15] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:08:15] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:23] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/230 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:08:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 615 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30019 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 197/197 constraints]
After SMT, in 55190ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 55192ms
Finished structural reductions in LTL mode , in 1 iterations and 55399 ms. Remains : 102/102 places, 156/156 transitions.
[2024-05-24 17:08:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:08:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:08:26] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:08:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:08:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:08:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1906198748709759883.gal : 2 ms
[2024-05-24 17:08:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1208090176017475375.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1906198748709759883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1208090176017475375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.68739,89404,2,15570,5,254562,6,0,566,359392,0


Converting to forward existential form...Done !
original formula: AF(EG((((((AX(AF((((((((P_b_3_false==1)&&(P_wait_2_3==1))&&(P_await_13_2==1))||(((P_b_3_false==1)&&(P_wait_4_3==1))&&(P_await_13_4==1)))|...2948
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((!(EX(!(!(EG(!((((((((P_b_3_false==1)&&(P_wait_2_3==1))&&(P_await_13_2==1))||(((P_b_3_false=...3011
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:08:56] [INFO ] Flatten gal took : 12 ms
[2024-05-24 17:08:56] [INFO ] Applying decomposition
[2024-05-24 17:08:56] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4595552900785382831.txt' '-o' '/tmp/graph4595552900785382831.bin' '-w' '/tmp/graph4595552900785382831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4595552900785382831.bin' '-l' '-1' '-v' '-w' '/tmp/graph4595552900785382831.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:08:56] [INFO ] Decomposing Gal with order
[2024-05-24 17:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:08:56] [INFO ] Removed a total of 157 redundant transitions.
[2024-05-24 17:08:56] [INFO ] Flatten gal took : 24 ms
[2024-05-24 17:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2024-05-24 17:08:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14731032050382939672.gal : 3 ms
[2024-05-24 17:08:56] [INFO ] Time to serialize properties into /tmp/CTLFireability27930885089745191.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14731032050382939672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability27930885089745191.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,8.86239,209868,3333,177,280118,1367,386,1.2922e+06,95,13258,0


Converting to forward existential form...Done !
original formula: AF(EG((((((AX(AF((((((((i4.u2.P_b_3_false==1)&&(i2.u15.P_wait_2_3==1))&&(i2.u14.P_await_13_2==1))||(((i4.u2.P_b_3_false==1)&&(i3.u18.P_wa...4096
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((!(EX(!(!(EG(!((((((((i4.u2.P_b_3_false==1)&&(i2.u15.P_wait_2_3==1))&&(i2.u14.P_await_13_2==...4159
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t52, t56, t76, t77, t78, t79, t104, t105, t106, t107,...655
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:09:26] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:09:26] [INFO ] Invariant cache hit.
[2024-05-24 17:09:26] [INFO ] Implicit Places using invariants in 99 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 17:09:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:09:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:09:26] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:09:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:09:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:09:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15534280476521138773.gal : 2 ms
[2024-05-24 17:09:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17508805109187298018.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15534280476521138773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17508805109187298018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,1.82279,57136,2,11489,5,165693,6,0,550,239530,0


Converting to forward existential form...Done !
original formula: AG(E(((EX((((((((P_b_4_false==1)&&(P_setbi_5_4==1))||((P_b_1_true==1)&&(P_setbi_5_1==1)))||(((P_b_2_false==1)&&(P_setbi_5_2==1))||((P_b_4...3730
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((EX((((((((P_b_4_false==1)&&(P_setbi_5_4==1))||((P_b_1_true==1)&&(P_setbi_5_1==1)))||((...3790
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:09:56] [INFO ] Flatten gal took : 12 ms
[2024-05-24 17:09:56] [INFO ] Applying decomposition
[2024-05-24 17:09:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4149742865450302231.txt' '-o' '/tmp/graph4149742865450302231.bin' '-w' '/tmp/graph4149742865450302231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4149742865450302231.bin' '-l' '-1' '-v' '-w' '/tmp/graph4149742865450302231.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:09:56] [INFO ] Decomposing Gal with order
[2024-05-24 17:09:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:09:56] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-24 17:09:56] [INFO ] Flatten gal took : 11 ms
[2024-05-24 17:09:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2024-05-24 17:09:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2827862939508825527.gal : 2 ms
[2024-05-24 17:09:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9569649033094056764.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2827862939508825527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9569649033094056764.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,14.3873,285632,4101,111,301016,1296,391,2.19785e+06,82,9992,0


Converting to forward existential form...Done !
original formula: AG(E(((EX((((((((i3.u3.P_b_4_false==1)&&(i4.u6.P_setbi_5_4==1))||((i0.u0.P_b_1_true==1)&&(i4.u4.P_setbi_5_1==1)))||(((i1.u1.P_b_2_false==...5118
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((EX((((((((i3.u3.P_b_4_false==1)&&(i4.u6.P_setbi_5_4==1))||((i0.u0.P_b_1_true==1)&&(i4....5178
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t58, t61, t76, t77, t78, t79, t104, t105, t106, t107,...616
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,26.4542,397304,1,0,517958,2396,2291,2.58917e+06,401,14118,982530
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:10:23] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:10:23] [INFO ] Invariant cache hit.
[2024-05-24 17:10:23] [INFO ] Implicit Places using invariants in 75 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 17:10:23] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:10:23] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:10:23] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:10:23] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:10:23] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3345804844703740047.gal : 2 ms
[2024-05-24 17:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6100803038036603625.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3345804844703740047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6100803038036603625.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.01644,56884,2,11489,5,165693,6,0,550,239530,0


Converting to forward existential form...Done !
original formula: EF(EG(((((((P_b_1_true==1)&&(P_setbi_24_1==1))||((P_b_1_false==1)&&(P_setbi_24_1==1)))||(((P_b_2_false==1)&&(P_setbi_24_2==1))||((P_b_3_f...1699
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((P_b_1_true==1)&&(P_setbi_24_1==1))||((P_b_1_false==1)&&(P_setbi_24_1==1)))||(((P_b_2...2026
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:10:53] [INFO ] Flatten gal took : 7 ms
[2024-05-24 17:10:53] [INFO ] Applying decomposition
[2024-05-24 17:10:53] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10126904356386962186.txt' '-o' '/tmp/graph10126904356386962186.bin' '-w' '/tmp/graph10126904356386962186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10126904356386962186.bin' '-l' '-1' '-v' '-w' '/tmp/graph10126904356386962186.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:10:53] [INFO ] Decomposing Gal with order
[2024-05-24 17:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:10:53] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-24 17:10:53] [INFO ] Flatten gal took : 9 ms
[2024-05-24 17:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2024-05-24 17:10:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15154129994236123645.gal : 1 ms
[2024-05-24 17:10:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16876079306533330630.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15154129994236123645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16876079306533330630.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,13.6116,342916,4308,162,364299,1989,396,2.59339e+06,96,16310,0


Converting to forward existential form...Done !
original formula: EF(EG(((((((i6.u0.P_b_1_true==1)&&(i7.u33.P_setbi_24_1==1))||((i6.u0.P_b_1_false==1)&&(i7.u33.P_setbi_24_1==1)))||(((i1.u1.P_b_2_false==1...2335
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((i6.u0.P_b_1_true==1)&&(i7.u33.P_setbi_24_1==1))||((i6.u0.P_b_1_false==1)&&(i7.u33.P_...2750
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t54, t63, t76, t77, t78, t79, t104, t105, t106, t107,...656
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,25.8199,425020,1,0,677165,6955,2173,2.59339e+06,504,41282,1208707
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:11:19] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:11:19] [INFO ] Invariant cache hit.
[2024-05-24 17:11:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 17:11:19] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:11:19] [INFO ] Invariant cache hit.
[2024-05-24 17:11:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 17:11:19] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-24 17:11:19] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-24 17:11:19] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:11:19] [INFO ] Invariant cache hit.
[2024-05-24 17:11:19] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:32] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/102 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 128/230 variables, 102/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:36] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:11:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:38] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 25 (OVERLAPS) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 420 constraints, problems are : Problem set: 0 solved, 152 unsolved in 24506 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 154/154 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 55/282 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 128/230 variables, 102/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 152/607 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:11:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:12:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:12:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/230 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:12:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 54582ms, After SMT, problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 54584ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54769 ms. Remains : 102/102 places, 156/156 transitions.
[2024-05-24 17:12:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:12:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:12:14] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:12:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:12:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:12:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4857997119583999117.gal : 1 ms
[2024-05-24 17:12:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9569091346337226445.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4857997119583999117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9569091346337226445.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.73068,89512,2,15570,5,254562,6,0,566,359392,0


Converting to forward existential form...Done !
original formula: E(EF(((((((x_2==1)&&(P_ifxi_10_4==1))||((x_4==1)&&(P_ifxi_10_1==1)))||(((x_0==1)&&(P_ifxi_10_2==1))||((x_0==1)&&(P_ifxi_10_3==1))))||((((...1656
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((((x_2==1)&&(P_ifxi_10_4==1))||((x_4==1)&&(P_ifxi_10_1==1)))||(((x_0==1)&&(P_ifxi_10_2==...1732
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:12:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 17:12:44] [INFO ] Applying decomposition
[2024-05-24 17:12:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14732177351498320463.txt' '-o' '/tmp/graph14732177351498320463.bin' '-w' '/tmp/graph14732177351498320463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14732177351498320463.bin' '-l' '-1' '-v' '-w' '/tmp/graph14732177351498320463.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:12:44] [INFO ] Decomposing Gal with order
[2024-05-24 17:12:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:12:44] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-24 17:12:44] [INFO ] Flatten gal took : 11 ms
[2024-05-24 17:12:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3 ms.
[2024-05-24 17:12:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1001990591194902840.gal : 1 ms
[2024-05-24 17:12:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10668731322156783170.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1001990591194902840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10668731322156783170.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,3.47491,100332,6221,178,146012,425,411,397407,77,3291,0


Converting to forward existential form...Done !
original formula: E(EF(((((((i0.u5.x_2==1)&&(u12.P_ifxi_10_4==1))||((i0.u7.x_4==1)&&(i1.u10.P_ifxi_10_1==1)))||(((i0.u4.x_0==1)&&(i1.u11.P_ifxi_10_2==1))||...2244
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((((i0.u5.x_2==1)&&(u12.P_ifxi_10_4==1))||((i0.u7.x_4==1)&&(i1.u10.P_ifxi_10_1==1)))||(((...2320
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t56, t63, t76, t77, t79, t104, t105, t106, t107, t108...575
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,11.2924,304200,1,0,450547,2818,2072,1.51327e+06,353,16633,1202668
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:12:55] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:12:55] [INFO ] Invariant cache hit.
[2024-05-24 17:12:55] [INFO ] Implicit Places using invariants in 76 ms returned [67, 68, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 99/102 places, 156/156 transitions.
[2024-05-24 17:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:12:55] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:12:55] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16186004851197403291.gal : 1 ms
[2024-05-24 17:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14327766291859820773.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16186004851197403291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14327766291859820773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,3.30152,86340,2,14679,5,242619,6,0,554,347042,0


Converting to forward existential form...Done !
original formula: EG(E(AF(!(((((P_b_4_false==1)&&(P_wait_1_4==1))&&((P_await_13_1==1)&&(y_0==1)))&&(P_CS_21_4==1)))) U AG(AX(((x_0==1)&&(P_setx_3_1==1)))))...156
=> equivalent forward existential formula: [FwdG(Init,E(!(EG(!(!(((((P_b_4_false==1)&&(P_wait_1_4==1))&&((P_await_13_1==1)&&(y_0==1)))&&(P_CS_21_4==1))))))...223
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
(forward)formula 0,0,12.695,266012,1,0,412,1.15441e+06,341,156,3855,1.48144e+06,329
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:13:08] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:13:08] [INFO ] Invariant cache hit.
[2024-05-24 17:13:08] [INFO ] Implicit Places using invariants in 75 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 17:13:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:13:08] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:13:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6528054676596040202.gal : 1 ms
[2024-05-24 17:13:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5468206488332525492.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6528054676596040202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5468206488332525492.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.12645,56960,2,11489,5,165693,6,0,550,239530,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * (((y_2==0)||(P_ify0_4_1==0))||((P_b_3_true==0)||(P_setbi_11_3==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(FwdU(Init,TRUE) * !((((y_2==0)||(P_ify0_4_1==0))||((P_b_3_true==0...189
(forward)formula 0,0,2.14984,56960,1,0,8,165693,9,2,571,239530,1
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:13:10] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 17:13:11] [INFO ] Invariant cache hit.
[2024-05-24 17:13:11] [INFO ] Implicit Places using invariants in 130 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 136 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 98/102 places, 156/156 transitions.
[2024-05-24 17:13:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 17:13:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 17:13:11] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-24 17:13:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7161690445078964804.gal : 1 ms
[2024-05-24 17:13:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9519137867126082201.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7161690445078964804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9519137867126082201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,2.08998,56900,2,11489,5,165693,6,0,550,239530,0


Converting to forward existential form...Done !
original formula: AG(EF((AX(FALSE) + A((((x_0==1)&&(P_ifxi_10_4==1))||((x_0==1)&&(P_setx_3_1==1))) U (((y_2==1)&&(P_sety_9_4==1))||((y_0==1)&&(P_awaity_4==...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(FALSE))) + !((E(!((((y_2==1)&&(P_sety_9_4==1))||((y_0==1)&&(P_awaity_4==1...374
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...659
Detected timeout of ITS tools.
[2024-05-24 17:13:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:13:41] [INFO ] Applying decomposition
[2024-05-24 17:13:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3114669463990988414.txt' '-o' '/tmp/graph3114669463990988414.bin' '-w' '/tmp/graph3114669463990988414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3114669463990988414.bin' '-l' '-1' '-v' '-w' '/tmp/graph3114669463990988414.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:13:41] [INFO ] Decomposing Gal with order
[2024-05-24 17:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:13:41] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-24 17:13:41] [INFO ] Flatten gal took : 8 ms
[2024-05-24 17:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2024-05-24 17:13:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1380911481642357348.gal : 2 ms
[2024-05-24 17:13:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13204806990478805741.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1380911481642357348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13204806990478805741.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,11.2129,268016,4532,391,317360,2185,405,1.85631e+06,92,24352,0


Converting to forward existential form...Done !
original formula: AG(EF((AX(FALSE) + A((((i4.u5.x_0==1)&&(i7.u32.P_ifxi_10_4==1))||((i4.u5.x_0==1)&&(i4.u7.P_setx_3_1==1))) U (((i7.u32.y_2==1)&&(i7.u32.P_...216
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(FALSE))) + !((E(!((((i7.u32.y_2==1)&&(i7.u32.P_sety_9_4==1))||((i7.u32.y_...483
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t50, t52, t56, t76, t77, t78, t79, t104, t105, t106, ...653
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,27.0964,501392,1,0,694151,14751,1940,2.72622e+06,487,101519,1304030
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 6 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2024-05-24 17:14:08] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
// Phase 1: matrix 124 rows 98 cols
[2024-05-24 17:14:08] [INFO ] Computed 26 invariants in 1 ms
[2024-05-24 17:14:08] [INFO ] Implicit Places using invariants in 71 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 94 transition count 149
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 91 transition count 149
Applied a total of 6 rules in 4 ms. Remains 91 /94 variables (removed 3) and now considering 149/152 (removed 3) transitions.
[2024-05-24 17:14:08] [INFO ] Flow matrix only has 121 transitions (discarded 28 similar events)
// Phase 1: matrix 121 rows 91 cols
[2024-05-24 17:14:08] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 17:14:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 17:14:08] [INFO ] Flow matrix only has 121 transitions (discarded 28 similar events)
[2024-05-24 17:14:08] [INFO ] Invariant cache hit.
[2024-05-24 17:14:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 17:14:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 91/102 places, 149/156 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 283 ms. Remains : 91/102 places, 149/156 transitions.
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:14:08] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 2659 steps (0 resets) in 12 ms. (204 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 17:14:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15503049944671734789.gal : 1 ms
[2024-05-24 17:14:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10518923321330233240.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15503049944671734789.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10518923321330233240.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 17:14:08] [INFO ] Applying decomposition
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10499320106187003941.txt' '-o' '/tmp/graph10499320106187003941.bin' '-w' '/tmp/graph10499320106187003941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10499320106187003941.bin' '-l' '-1' '-v' '-w' '/tmp/graph10499320106187003941.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:14:08] [INFO ] Decomposing Gal with order
[2024-05-24 17:14:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:14:08] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-24 17:14:08] [INFO ] Flatten gal took : 10 ms
[2024-05-24 17:14:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 2 ms.
[2024-05-24 17:14:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6417592348483027590.gal : 2 ms
[2024-05-24 17:14:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15244439387084278109.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6417592348483027590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15244439387084278109.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,14.7677,279244,3504,120,290943,1228,423,2.13947e+06,85,9419,0


Converting to forward existential form...Done !
original formula: AG(EF((EG(((((i6.u33.y_0==0)||(i2.u30.P_awaity_2==0))&&((i6.u33.y_0==0)||(i4.i1.u28.P_awaity_3==0)))&&(((i6.u33.y_0==0)||(i5.u31.P_awaity...386
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (EG(((((i6.u33.y_0==0)||(i2.u30.P_awaity_2==0))&&((i6.u33.y_0==0)||(i4.i1.u28.P_a...446
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t56, t62, t76, t77, t78, t79, t104, t105, t106, t107,...618
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,39.8257,575716,1,0,799042,2199,1981,3.082e+06,401,12113,1294957
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((((((((i6.u33.y_2==1)&&(i3.u29.P_ifyi_15_1==1))||((i6.u33.y_2==1)&&(i4.i1.u28.P_ifyi_15_3==1)))||(((i6.u33.y_0==1)&&(i5.u31.P_ifyi_15_...2225
=> equivalent forward existential formula: ((([(((FwdU(Init,TRUE) * ((((((i6.u33.y_2==1)&&(i3.u29.P_ifyi_15_1==1))||((i6.u33.y_2==1)&&(i4.i1.u28.P_ifyi_15_...6361
(forward)formula 1,1,58.0559,917656,1,0,1.36585e+06,2497,2225,4.69774e+06,408,13254,2050471
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(EG((((((AX(AF((((((((i4.i1.u2.P_b_3_false==1)&&(i2.u21.P_wait_2_3==1))&&(i2.u14.P_await_13_2==1))||(((i4.i1.u2.P_b_3_false==1)&&(i5.u1...4165
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((!(EX(!(!(EG(!((((((((i4.i1.u2.P_b_3_false==1)&&(i2.u21.P_wait_2_3==1))&&(i2.u14.P_await_13_...4228
(forward)formula 2,0,117.942,2021916,1,0,2.91422e+06,2741,2782,1.03824e+07,428,15207,4419210
FORMULA LamportFastMutEx-PT-4-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 810880 ms.

BK_STOP 1716570967216

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-4, 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 r224-tall-171649612400274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 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 ;