Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 18K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 07:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 13 07:42 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 9.7K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K 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 36K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 51K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 276K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 157K 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-5-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717226939150

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:29:00] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:29:00] [INFO ] Transformed 174 places.
[2024-06-01 07:29:00] [INFO ] Transformed 318 transitions.
[2024-06-01 07:29:00] [INFO ] Found NUPN structural information;
[2024-06-01 07:29:00] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2024-06-01 07:29:00] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 121 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-01 07:29:00] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-06-01 07:29:00] [INFO ] Computed 37 invariants in 20 ms
[2024-06-01 07:29:01] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 07:29:01] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:29:01] [INFO ] Invariant cache hit.
[2024-06-01 07:29:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 07:29:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-01 07:29:01] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:29:01] [INFO ] Invariant cache hit.
[2024-06-01 07:29:01] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 37/174 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 14 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/194 constraints. Problems are: Problem set: 11 solved, 244 unsolved
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 5 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/214 constraints. Problems are: Problem set: 18 solved, 237 unsolved
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 11 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/234 constraints. Problems are: Problem set: 25 solved, 230 unsolved
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/254 constraints. Problems are: Problem set: 26 solved, 229 unsolved
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 20/274 constraints. Problems are: Problem set: 28 solved, 227 unsolved
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/294 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/314 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 20/334 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 20/354 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 18/372 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 8/380 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 7/387 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:25] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:25] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:29:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 12/399 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:26] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:26] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 4/403 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:27] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 4/407 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 2/409 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 30211ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30754 ms. Remains : 137/137 places, 230/260 transitions.
Support contains 121 out of 137 places after structural reductions.
[2024-06-01 07:29:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 07:29:31] [INFO ] Flatten gal took : 41 ms
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:29:31] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:29:31] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 2166 ms. (18 steps per ms) remains 17/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
[2024-06-01 07:29:32] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-06-01 07:29:32] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 07:29:32] [INFO ] State equation strengthened by 50 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/115 variables, 30/106 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 39/145 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/145 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 180/295 variables, 115/260 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 50/310 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/310 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/317 variables, 22/332 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 22/354 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 7/361 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/361 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/317 variables, 0/361 constraints. Problems are: Problem set: 16 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 361 constraints, problems are : Problem set: 16 solved, 1 unsolved in 192 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 56/60 variables, 13/17 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 56/73 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/73 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/69 variables, 5/78 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 9/87 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/177 variables, 69/156 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 24/180 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/180 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/225 variables, 18/198 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 18/216 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 5/221 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 6/227 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 1/228 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/228 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/257 variables, 12/240 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/257 variables, 12/252 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/257 variables, 10/262 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/257 variables, 0/262 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 34/291 variables, 12/274 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/291 variables, 34/308 constraints. Problems are: Problem set: 16 solved, 1 unsolved
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/291 variables, 1/309 constraints. Problems are: Problem set: 16 solved, 1 unsolved
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/291 variables, 1/310 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/291 variables, 0/310 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/317 variables, 38/348 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/317 variables, 4/352 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/317 variables, 2/354 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/317 variables, 10/364 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/317 variables, 0/364 constraints. Problems are: Problem set: 16 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/317 variables, 0/364 constraints. Problems are: Problem set: 16 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 364 constraints, problems are : Problem set: 16 solved, 1 unsolved in 323 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 550ms problems are : Problem set: 16 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 225
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 132 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 129 transition count 222
Applied a total of 16 rules in 52 ms. Remains 129 /137 variables (removed 8) and now considering 222/230 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 129/137 places, 222/230 transitions.
RANDOM walk for 34898 steps (7 resets) in 352 ms. (98 steps per ms) remains 0/1 properties
Successfully simplified 16 atomic propositions for a total of 12 simplifications.
[2024-06-01 07:29:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:29:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 64 out of 137 places (down from 107) after GAL structural reductions.
Computed a total of 1 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 230/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 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 133 transition count 226
Applied a total of 8 rules in 12 ms. Remains 133 /137 variables (removed 4) and now considering 226/230 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 133/137 places, 226/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 2723 steps (0 resets) in 22 ms. (118 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 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 133 transition count 226
Applied a total of 8 rules in 11 ms. Remains 133 /137 variables (removed 4) and now considering 226/230 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 133/137 places, 226/230 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Input system was already deterministic with 226 transitions.
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:29:33] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:29:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 230 transitions and 1000 arcs took 3 ms.
Total runtime 33557 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-00
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-05
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-07
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-08
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-09
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-11
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-12
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLCardinality-2024-14

BK_STOP 1717226974258

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1239/ctl_0_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1239/ctl_1_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1239/ctl_2_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1239/ctl_3_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1239/ctl_4_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1239/ctl_5_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1239/ctl_6_
ctl formula name LamportFastMutEx-PT-5-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1239/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;