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.r234-tall-167856420300437.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 marciexred
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 r234-tall-167856420300437
=====================================================================

--------------------
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 1679499469832

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:37:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 15:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:37:51] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-22 15:37:51] [INFO ] Transformed 264 places.
[2023-03-22 15:37:51] [INFO ] Transformed 536 transitions.
[2023-03-22 15:37:51] [INFO ] Found NUPN structural information;
[2023-03-22 15:37:51] [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-22 15:37:51] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 45 places in 2 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-22 15:37:51] [INFO ] Computed 65 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 15) seen :88
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 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :64
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 :34
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 :71
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 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :61
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :69
[2023-03-22 15:37:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 15:37:51] [INFO ] Computed 65 place invariants in 8 ms
[2023-03-22 15:37:52] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2023-03-22 15:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:52] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-22 15:37:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-22 15:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:52] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 15:37:52] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:37:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 53 ms returned sat
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 4 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1174 ms
[2023-03-22 15:37:53] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-22 15:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:53] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-22 15:37:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-22 15:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:53] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 15:37:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-22 15:37:54] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 32 ms.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1073 ms
[2023-03-22 15:37:55] [INFO ] Added : 83 causal constraints over 17 iterations in 1566 ms. Result :sat
Minimization took 197 ms.
[2023-03-22 15:37:55] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 15:37:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:56] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 15:37:56] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 1820 ms
[2023-03-22 15:37:57] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 15:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:58] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 15:37:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 15:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:58] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 15:37:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 15:37:58] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 22 ms.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-22 15:37:58] [INFO ] Added : 87 causal constraints over 18 iterations in 658 ms. Result :sat
Minimization took 119 ms.
[2023-03-22 15:37:59] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 15:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:59] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 15:37:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-22 15:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:59] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 15:37:59] [INFO ] [Nat]Added 91 Read/Feed constraints in 56 ms returned sat
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 793 ms
[2023-03-22 15:38:00] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 25 ms.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 742 ms
[2023-03-22 15:38:01] [INFO ] Added : 75 causal constraints over 16 iterations in 1254 ms. Result :sat
Minimization took 272 ms.
[2023-03-22 15:38:01] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:01] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 15:38:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:01] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 15:38:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1025 ms
[2023-03-22 15:38:03] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:03] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 15:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 15:38:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1133 ms
Current structural bounds on expressions (after SMT) : [42, 7, 6, 7, 49, 6, 6] Max seen :[42, 1, 6, 4, 35, 6, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-06 6 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 63 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 219 transition count 455
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 52 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 212/219 places, 455/462 transitions.
Normalized transition count is 329 out of 455 initially.
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 15:38:05] [INFO ] Computed 65 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3175 ms. (steps per millisecond=314 ) properties (out of 3) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 3) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1816 ms. (steps per millisecond=550 ) properties (out of 3) seen :47
[2023-03-22 15:38:12] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 15:38:12] [INFO ] Computed 65 place invariants in 10 ms
[2023-03-22 15:38:12] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 15:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:12] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 15:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 15:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:12] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 15:38:12] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:38:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-22 15:38:12] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 27 ms.
[2023-03-22 15:38:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 15:38:12] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:38:12] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-22 15:38:13] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-03-22 15:38:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 15:38:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 15:38:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 601 ms
[2023-03-22 15:38:13] [INFO ] Added : 66 causal constraints over 15 iterations in 961 ms. Result :sat
Minimization took 136 ms.
[2023-03-22 15:38:13] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:13] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 15:38:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:13] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 15:38:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 15:38:13] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 25 ms.
[2023-03-22 15:38:14] [INFO ] Added : 86 causal constraints over 18 iterations in 467 ms. Result :sat
Minimization took 155 ms.
[2023-03-22 15:38:14] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:14] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 15:38:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 15:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:14] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 15:38:14] [INFO ] [Nat]Added 91 Read/Feed constraints in 76 ms returned sat
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 0 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1187 ms
Current structural bounds on expressions (after SMT) : [7, 7, 42] Max seen :[1, 5, 42]
FORMULA LamportFastMutEx-PT-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 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 205 transition count 448
Applied a total of 14 rules in 34 ms. Remains 205 /212 variables (removed 7) and now considering 448/455 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 205/212 places, 448/455 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 15:38:16] [INFO ] Computed 65 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2364 ms. (steps per millisecond=423 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 2) seen :2
[2023-03-22 15:38:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 15:38:19] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-22 15:38:19] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 15:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:20] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:20] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 15:38:20] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:38:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-22 15:38:20] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 15:38:20] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:20] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2023-03-22 15:38:20] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2023-03-22 15:38:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 15:38:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 15:38:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-22 15:38:21] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:38:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 619 ms
[2023-03-22 15:38:21] [INFO ] Added : 79 causal constraints over 16 iterations in 1040 ms. Result :sat
Minimization took 149 ms.
[2023-03-22 15:38:21] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:21] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 15:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 15:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:21] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 15:38:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 15:38:21] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 15:38:22] [INFO ] Added : 98 causal constraints over 21 iterations in 515 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 5]
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 15:38:22] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:22] [INFO ] Invariant cache hit.
[2023-03-22 15:38:22] [INFO ] Implicit Places using invariants in 218 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 220 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 245 ms. 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-22 15:38:22] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 2) seen :2
[2023-03-22 15:38:26] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:26] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 15:38:26] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:26] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:26] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-22 15:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:26] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 15:38:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 13 ms returned sat
[2023-03-22 15:38:26] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 15:38:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 15:38:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
[2023-03-22 15:38:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-22 15:38:27] [INFO ] Added : 78 causal constraints over 16 iterations in 500 ms. Result :sat
Minimization took 153 ms.
[2023-03-22 15:38:27] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:27] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 15:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 15:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:27] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 15:38:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 15:38:27] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 15:38:28] [INFO ] Added : 95 causal constraints over 19 iterations in 664 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 5]
Support contains 14 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 10 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY 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-22 15:38:28] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:28] [INFO ] Invariant cache hit.
[2023-03-22 15:38:28] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-22 15:38:28] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:28] [INFO ] Invariant cache hit.
[2023-03-22 15:38:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-22 15:38:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 15:38:29] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:29] [INFO ] Invariant cache hit.
[2023-03-22 15:38:29] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. 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-22 15:38:29] [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-22 15:38:29] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:29] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 15:38:29] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:29] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 15:38:29] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 28 ms.
[2023-03-22 15:38:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-22 15:38:30] [INFO ] Added : 78 causal constraints over 16 iterations in 491 ms. Result :sat
Minimization took 149 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 9 ms. 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-22 15:38:30] [INFO ] Computed 58 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2061 ms. (steps per millisecond=485 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :1
[2023-03-22 15:38:33] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:33] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 15:38:33] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2023-03-22 15:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 15:38:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 15:38:33] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 15:38:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 15:38:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-22 15:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-22 15:38:33] [INFO ] Added : 78 causal constraints over 16 iterations in 485 ms. Result :sat
Minimization took 158 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 15:38:34] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:34] [INFO ] Invariant cache hit.
[2023-03-22 15:38:34] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-22 15:38:34] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:34] [INFO ] Invariant cache hit.
[2023-03-22 15:38:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:34] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-22 15:38:34] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 15:38:34] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:34] [INFO ] Invariant cache hit.
[2023-03-22 15:38:34] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01 in 5513 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-22 15:38:34] [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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-22 15:38:34] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:34] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 15:38:34] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:34] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 15:38:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:35] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 15:38:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:35] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 15:38:35] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 15:38:35] [INFO ] Added : 92 causal constraints over 19 iterations in 462 ms. Result :sat
Minimization took 69 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 7 ms. 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-22 15:38:35] [INFO ] Computed 58 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 1) seen :1
[2023-03-22 15:38:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:38] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 15:38:38] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:38] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-22 15:38:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 15:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:38] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 15:38:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 15:38:38] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 15:38:39] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:38:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 919 ms
[2023-03-22 15:38:40] [INFO ] Added : 230 causal constraints over 46 iterations in 2168 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 15:38:41] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:41] [INFO ] Invariant cache hit.
[2023-03-22 15:38:41] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-22 15:38:41] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:41] [INFO ] Invariant cache hit.
[2023-03-22 15:38:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:41] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-22 15:38:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 15:38:41] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:41] [INFO ] Invariant cache hit.
[2023-03-22 15:38:41] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. 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-22 15:38:41] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 1) seen :1
[2023-03-22 15:38:44] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 15:38:44] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 15:38:44] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 15:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:44] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-22 15:38:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 15:38:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2023-03-22 15:38:44] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-22 15:38:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 928 ms
[2023-03-22 15:38:46] [INFO ] Added : 230 causal constraints over 46 iterations in 2202 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY 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-22 15:38:47] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:47] [INFO ] Invariant cache hit.
[2023-03-22 15:38:47] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-22 15:38:47] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:47] [INFO ] Invariant cache hit.
[2023-03-22 15:38:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:38:47] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-22 15:38:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 15:38:47] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 15:38:47] [INFO ] Invariant cache hit.
[2023-03-22 15:38:48] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 670 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-04 in 13376 ms.
[2023-03-22 15:38:48] [INFO ] Flatten gal took : 66 ms
[2023-03-22 15:38:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 19 ms.
[2023-03-22 15:38:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 448 transitions and 2212 arcs took 3 ms.
Total runtime 57058 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: LamportFastMutEx_PT_7
(NrP: 198 NrTr: 448 NrArc: 2212)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec

net check time: 0m 0.000sec

init dd package: 0m 2.694sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7083080 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099400 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

119013 536620 440251 1127797 1019111 975484 956555 916659 1092339 1010076 1069787 1078588

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="marciexred"
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 marciexred"
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 r234-tall-167856420300437"
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 ;