Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 30K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 240K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Feb 25 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 499K Feb 25 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678751266562

Running Version 202205111006
[2023-03-13 23:47:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:47:47] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-13 23:47:47] [INFO ] Transformed 264 places.
[2023-03-13 23:47:47] [INFO ] Transformed 536 transitions.
[2023-03-13 23:47:47] [INFO ] Found NUPN structural information;
[2023-03-13 23:47:47] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2023-03-13 23:47:47] [INFO ] Parsed PT model containing 264 places and 536 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2023-03-13 23:47:48] [INFO ] Computed 65 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 15) seen :87
FORMULA LamportFastMutEx-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :67
FORMULA LamportFastMutEx-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :74
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :60
[2023-03-13 23:47:48] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-13 23:47:48] [INFO ] Computed 65 place invariants in 9 ms
[2023-03-13 23:47:48] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-13 23:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:48] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-13 23:47:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:47:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2023-03-13 23:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:48] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-13 23:47:48] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-13 23:47:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 52 ms returned sat
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-13 23:47:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 914 ms
[2023-03-13 23:47:49] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 90 ms.
[2023-03-13 23:47:51] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-13 23:47:51] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:47:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1311 ms
[2023-03-13 23:47:52] [INFO ] Added : 194 causal constraints over 41 iterations in 2971 ms. Result :sat
Minimization took 513 ms.
[2023-03-13 23:47:53] [INFO ] [Real]Absence check using 65 positive place invariants in 33 ms returned sat
[2023-03-13 23:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-13 23:47:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:47:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-13 23:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:53] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:47:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:47:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-13 23:47:53] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 25 ms.
[2023-03-13 23:47:54] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2023-03-13 23:47:54] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-13 23:47:54] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-13 23:47:54] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2023-03-13 23:47:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1502 ms
[2023-03-13 23:47:55] [INFO ] Added : 83 causal constraints over 17 iterations in 2211 ms. Result :sat
Minimization took 170 ms.
[2023-03-13 23:47:56] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-13 23:47:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:47:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-13 23:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:56] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 23:47:56] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2023-03-13 23:47:56] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-13 23:47:56] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:47:56] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-13 23:47:56] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 4 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-03-13 23:47:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1262 ms
[2023-03-13 23:47:57] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-13 23:47:58] [INFO ] Added : 120 causal constraints over 25 iterations in 751 ms. Result :sat
Minimization took 205 ms.
[2023-03-13 23:47:58] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-13 23:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:58] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:47:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:47:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:47:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-13 23:47:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:47:59] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 42 ms.
[2023-03-13 23:47:59] [INFO ] Added : 77 causal constraints over 16 iterations in 459 ms. Result :sat
Minimization took 133 ms.
[2023-03-13 23:47:59] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:59] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-13 23:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:47:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2023-03-13 23:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:47:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-13 23:48:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 59 ms returned sat
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:48:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 815 ms
[2023-03-13 23:48:00] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 34 ms.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 6 ms to minimize.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:48:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:48:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-13 23:48:02] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:48:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 829 ms
[2023-03-13 23:48:02] [INFO ] Added : 75 causal constraints over 16 iterations in 1396 ms. Result :sat
Minimization took 235 ms.
[2023-03-13 23:48:02] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-13 23:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:02] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-13 23:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:02] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-13 23:48:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:48:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-13 23:48:02] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 3 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:48:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 672 ms
[2023-03-13 23:48:03] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 33 ms.
[2023-03-13 23:48:03] [INFO ] Added : 56 causal constraints over 12 iterations in 366 ms. Result :sat
Minimization took 120 ms.
[2023-03-13 23:48:04] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:04] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-13 23:48:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:04] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 23:48:04] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-13 23:48:04] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:48:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1273 ms
Current structural bounds on expressions (after SMT) : [49, 7, 7, 7, 49, 7, 6] Max seen :[38, 1, 5, 5, 35, 5, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 126 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 27 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 462/462 transitions.
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2023-03-13 23:48:07] [INFO ] Computed 65 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3781 ms. (steps per millisecond=264 ) properties (out of 6) seen :87
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1614 ms. (steps per millisecond=619 ) properties (out of 6) seen :68
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 6) seen :76
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 6) seen :26
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 6) seen :88
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 6) seen :65
[2023-03-13 23:48:17] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-13 23:48:17] [INFO ] Computed 65 place invariants in 5 ms
[2023-03-13 23:48:17] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:17] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:17] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-13 23:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:17] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 23:48:17] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-13 23:48:17] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2023-03-13 23:48:17] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:48:17] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:48:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1155 ms
[2023-03-13 23:48:19] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:19] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-13 23:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:19] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-13 23:48:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:48:19] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-13 23:48:19] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 18 ms.
[2023-03-13 23:48:19] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:48:19] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2023-03-13 23:48:19] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:48:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1102 ms
[2023-03-13 23:48:20] [INFO ] Added : 83 causal constraints over 17 iterations in 1529 ms. Result :sat
Minimization took 170 ms.
[2023-03-13 23:48:21] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:21] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-13 23:48:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-13 23:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:21] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:48:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-13 23:48:21] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:48:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-13 23:48:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:23] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-13 23:48:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 1851 ms
[2023-03-13 23:48:23] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:23] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-13 23:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:23] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-13 23:48:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2023-03-13 23:48:23] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 21 ms.
[2023-03-13 23:48:23] [INFO ] Added : 69 causal constraints over 14 iterations in 419 ms. Result :sat
Minimization took 84 ms.
[2023-03-13 23:48:24] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-13 23:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:24] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-13 23:48:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-13 23:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:24] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 23:48:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 68 ms returned sat
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:48:24] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-13 23:48:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1497 ms
[2023-03-13 23:48:25] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:25] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-13 23:48:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:26] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 23:48:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:48:26] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:27] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:27] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:48:27] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:48:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1107 ms
Current structural bounds on expressions (after SMT) : [42, 7, 6, 7, 42, 6] Max seen :[42, 1, 6, 6, 42, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 56 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/219 places, 448/462 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-13 23:48:27] [INFO ] Computed 65 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 2) seen :2
[2023-03-13 23:48:31] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-13 23:48:31] [INFO ] Computed 65 place invariants in 11 ms
[2023-03-13 23:48:31] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-13 23:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:31] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-13 23:48:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:31] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-13 23:48:31] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-13 23:48:31] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-13 23:48:31] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-13 23:48:32] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-13 23:48:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-13 23:48:32] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-13 23:48:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2023-03-13 23:48:32] [INFO ] Added : 77 causal constraints over 17 iterations in 793 ms. Result :sat
Minimization took 158 ms.
[2023-03-13 23:48:32] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:32] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-13 23:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-13 23:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-13 23:48:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:48:32] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 22 ms.
[2023-03-13 23:48:33] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2023-03-13 23:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-13 23:48:33] [INFO ] Added : 68 causal constraints over 14 iterations in 488 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 6]
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-13 23:48:33] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-13 23:48:33] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-13 23:48:33] [INFO ] Implicit Places using invariants in 198 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 199 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 198/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:33] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 2) seen :2
[2023-03-13 23:48:37] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:37] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-13 23:48:37] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-13 23:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-13 23:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-13 23:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:37] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-13 23:48:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:48:37] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2023-03-13 23:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-13 23:48:37] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-13 23:48:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-13 23:48:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:48:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-13 23:48:38] [INFO ] Added : 71 causal constraints over 15 iterations in 498 ms. Result :sat
Minimization took 113 ms.
[2023-03-13 23:48:38] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-13 23:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:38] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-13 23:48:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:38] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-13 23:48:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:48:38] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-13 23:48:39] [INFO ] Added : 132 causal constraints over 27 iterations in 721 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 6]
Support contains 14 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-13 23:48:39] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:39] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-13 23:48:39] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-13 23:48:39] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:39] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-13 23:48:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:40] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-13 23:48:40] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-13 23:48:40] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:40] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-13 23:48:40] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:40] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-13 23:48:40] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:40] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-13 23:48:40] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-13 23:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:40] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-13 23:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:40] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:40] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-13 23:48:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:48:40] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-13 23:48:40] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-13 23:48:41] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-13 23:48:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:48:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-13 23:48:41] [INFO ] Added : 71 causal constraints over 15 iterations in 528 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:41] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1944 ms. (steps per millisecond=514 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :1
[2023-03-13 23:48:44] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:44] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-13 23:48:44] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:44] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-13 23:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:44] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-13 23:48:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:48:44] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-13 23:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-13 23:48:44] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-13 23:48:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-13 23:48:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:48:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-03-13 23:48:45] [INFO ] Added : 71 causal constraints over 15 iterations in 565 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-13 23:48:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:45] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-13 23:48:45] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-13 23:48:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:45] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-13 23:48:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:45] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-13 23:48:45] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-13 23:48:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:45] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-13 23:48:46] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01 in 5708 ms.
Starting property specific reduction for LamportFastMutEx-PT-7-UpperBounds-04
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:46] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-13 23:48:46] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:46] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-13 23:48:46] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:46] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-13 23:48:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-13 23:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:46] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 23:48:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:48:46] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 26 ms.
[2023-03-13 23:48:46] [INFO ] Added : 66 causal constraints over 14 iterations in 394 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:47] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 1) seen :1
[2023-03-13 23:48:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:49] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-13 23:48:49] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 23:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-13 23:48:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:48:49] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-13 23:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:48:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 23:48:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:48:49] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-13 23:48:50] [INFO ] Added : 151 causal constraints over 31 iterations in 875 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-13 23:48:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:51] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-13 23:48:51] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-13 23:48:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:51] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-13 23:48:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 23:48:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-13 23:48:51] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-13 23:48:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-13 23:48:51] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-13 23:48:51] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-04 in 5692 ms.
[2023-03-13 23:48:52] [INFO ] Flatten gal took : 71 ms
[2023-03-13 23:48:52] [INFO ] Applying decomposition
[2023-03-13 23:48:52] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8620853497240944811.txt' '-o' '/tmp/graph8620853497240944811.bin' '-w' '/tmp/graph8620853497240944811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8620853497240944811.bin' '-l' '-1' '-v' '-w' '/tmp/graph8620853497240944811.weights' '-q' '0' '-e' '0.001'
[2023-03-13 23:48:52] [INFO ] Decomposing Gal with order
[2023-03-13 23:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:48:52] [INFO ] Removed a total of 663 redundant transitions.
[2023-03-13 23:48:52] [INFO ] Flatten gal took : 98 ms
[2023-03-13 23:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 16 ms.
[2023-03-13 23:48:52] [INFO ] Time to serialize gal into /tmp/UpperBounds1243972983639057955.gal : 13 ms
[2023-03-13 23:48:52] [INFO ] Time to serialize properties into /tmp/UpperBounds8995711027569633638.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1243972983639057955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8995711027569633638.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds8995711027569633638.prop.
Detected timeout of ITS tools.
[2023-03-14 00:09:14] [INFO ] Applying decomposition
[2023-03-14 00:09:14] [INFO ] Flatten gal took : 61 ms
[2023-03-14 00:09:14] [INFO ] Decomposing Gal with order
[2023-03-14 00:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 00:09:14] [INFO ] Removed a total of 495 redundant transitions.
[2023-03-14 00:09:14] [INFO ] Flatten gal took : 158 ms
[2023-03-14 00:09:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 6 ms.
[2023-03-14 00:09:14] [INFO ] Time to serialize gal into /tmp/UpperBounds5723319294889867913.gal : 3 ms
[2023-03-14 00:09:14] [INFO ] Time to serialize properties into /tmp/UpperBounds3024056676523047642.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5723319294889867913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3024056676523047642.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds3024056676523047642.prop.
Detected timeout of ITS tools.
[2023-03-14 00:29:46] [INFO ] Flatten gal took : 267 ms
[2023-03-14 00:29:48] [INFO ] Input system was already deterministic with 448 transitions.
[2023-03-14 00:29:48] [INFO ] Transformed 198 places.
[2023-03-14 00:29:48] [INFO ] Transformed 448 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-14 00:29:48] [INFO ] Time to serialize gal into /tmp/UpperBounds17701243784403331193.gal : 10 ms
[2023-03-14 00:29:48] [INFO ] Time to serialize properties into /tmp/UpperBounds823799576860633837.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17701243784403331193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds823799576860633837.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds823799576860633837.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is LamportFastMutEx-PT-7, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r255-tall-167856440300055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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