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.r235-tall-167856421800429.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 smartxred
Input is LamportFastMutEx-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421800429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 16K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 175K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 68K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 349K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 208K 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678652963650

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-6
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 20:29:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 20:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:29:25] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-12 20:29:25] [INFO ] Transformed 217 places.
[2023-03-12 20:29:25] [INFO ] Transformed 420 transitions.
[2023-03-12 20:29:25] [INFO ] Found NUPN structural information;
[2023-03-12 20:29:25] [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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, 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_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]
[2023-03-12 20:29:25] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 66 transitions.
FORMULA LamportFastMutEx-PT-6-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 264 out of 354 initially.
// Phase 1: matrix 264 rows 176 cols
[2023-03-12 20:29:25] [INFO ] Computed 50 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :41
FORMULA LamportFastMutEx-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :27
FORMULA LamportFastMutEx-PT-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :33
[2023-03-12 20:29:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-12 20:29:25] [INFO ] Computed 50 place invariants in 6 ms
[2023-03-12 20:29:25] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-12 20:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:25] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-12 20:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-12 20:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:26] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 20:29:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 20:29:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-12 20:29:26] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
[2023-03-12 20:29:26] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-12 20:29:26] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-12 20:29:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2023-03-12 20:29:26] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 25 ms.
[2023-03-12 20:29:26] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-12 20:29:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-12 20:29:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 757 ms
[2023-03-12 20:29:27] [INFO ] Added : 93 causal constraints over 20 iterations in 1210 ms. Result :sat
Minimization took 156 ms.
[2023-03-12 20:29:27] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-12 20:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:27] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-12 20:29:27] [INFO ] [Real]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-12 20:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-12 20:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:27] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-12 20:29:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-12 20:29:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 583 ms
[2023-03-12 20:29:28] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 16 ms.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-12 20:29:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 652 ms
[2023-03-12 20:29:29] [INFO ] Added : 130 causal constraints over 27 iterations in 1408 ms. Result :sat
Minimization took 456 ms.
[2023-03-12 20:29:30] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-12 20:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-12 20:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-12 20:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:30] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-12 20:29:30] [INFO ] [Nat]Added 72 Read/Feed constraints in 23 ms returned sat
[2023-03-12 20:29:30] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-03-12 20:29:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-12 20:29:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-12 20:29:30] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 897 ms
[2023-03-12 20:29:31] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:31] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-12 20:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:31] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 20:29:31] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-12 20:29:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-12 20:29:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 772 ms
Current structural bounds on expressions (after SMT) : [6, 36, 5, 5] Max seen :[1, 27, 5, 5]
FORMULA LamportFastMutEx-PT-6-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 42 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 32 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 170/176 places, 348/354 transitions.
Normalized transition count is 258 out of 348 initially.
// Phase 1: matrix 258 rows 170 cols
[2023-03-12 20:29:32] [INFO ] Computed 50 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2344 ms. (steps per millisecond=426 ) properties (out of 2) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 2) seen :31
[2023-03-12 20:29:37] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-12 20:29:37] [INFO ] Computed 50 place invariants in 8 ms
[2023-03-12 20:29:37] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:37] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 20:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-12 20:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:37] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-12 20:29:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 20:29:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2023-03-12 20:29:37] [INFO ] Computed and/alt/rep : 228/1284/228 causal constraints (skipped 24 transitions) in 23 ms.
[2023-03-12 20:29:37] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2023-03-12 20:29:37] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2023-03-12 20:29:37] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2023-03-12 20:29:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 901 ms
[2023-03-12 20:29:38] [INFO ] Added : 97 causal constraints over 21 iterations in 1345 ms. Result :sat
Minimization took 163 ms.
[2023-03-12 20:29:38] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:38] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-12 20:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-12 20:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:39] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-12 20:29:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 29 ms returned sat
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
[2023-03-12 20:29:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2023-03-12 20:29:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 877 ms
Current structural bounds on expressions (after SMT) : [6, 30] Max seen :[1, 30]
FORMULA LamportFastMutEx-PT-6-UpperBounds-04 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 342
Applied a total of 12 rules in 29 ms. Remains 164 /170 variables (removed 6) and now considering 342/348 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 164/170 places, 342/348 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2023-03-12 20:29:40] [INFO ] Computed 50 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1877 ms. (steps per millisecond=532 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 1) seen :1
[2023-03-12 20:29:42] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-12 20:29:42] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-12 20:29:42] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:42] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 20:29:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-12 20:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:42] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-12 20:29:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 20:29:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 21 ms returned sat
[2023-03-12 20:29:42] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 19 ms.
[2023-03-12 20:29:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-12 20:29:43] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-12 20:29:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-12 20:29:43] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-12 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 274 ms
[2023-03-12 20:29:43] [INFO ] Added : 49 causal constraints over 11 iterations in 516 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-12 20:29:43] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:43] [INFO ] Invariant cache hit.
[2023-03-12 20:29:43] [INFO ] Implicit Places using invariants in 161 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 166 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 186 ms. Remains : 158/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:43] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 1) seen :1
[2023-03-12 20:29:46] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:46] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-12 20:29:46] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-12 20:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:46] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-12 20:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:46] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-12 20:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:46] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-12 20:29:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 20:29:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-12 20:29:46] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 16 ms.
[2023-03-12 20:29:46] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-12 20:29:46] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-12 20:29:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-03-12 20:29:46] [INFO ] Added : 64 causal constraints over 13 iterations in 391 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-12 20:29:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:47] [INFO ] Invariant cache hit.
[2023-03-12 20:29:47] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 20:29:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:47] [INFO ] Invariant cache hit.
[2023-03-12 20:29:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 20:29:47] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-12 20:29:47] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 20:29:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:47] [INFO ] Invariant cache hit.
[2023-03-12 20:29:47] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 158/158 places, 342/342 transitions.
Starting property specific reduction for LamportFastMutEx-PT-6-UpperBounds-02
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:47] [INFO ] Computed 44 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :1
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-12 20:29:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:47] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-12 20:29:47] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-12 20:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:47] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-12 20:29:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:47] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-12 20:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:47] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-12 20:29:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 20:29:47] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-12 20:29:47] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-12 20:29:48] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-12 20:29:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-12 20:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-12 20:29:48] [INFO ] Added : 64 causal constraints over 13 iterations in 392 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:48] [INFO ] Computed 44 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :1
[2023-03-12 20:29:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-12 20:29:50] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-12 20:29:50] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-12 20:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-12 20:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:29:50] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-12 20:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:29:51] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-12 20:29:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 20:29:51] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-12 20:29:51] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 22 ms.
[2023-03-12 20:29:51] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-12 20:29:51] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-12 20:29:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-12 20:29:51] [INFO ] Added : 64 causal constraints over 13 iterations in 400 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-12 20:29:51] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:51] [INFO ] Invariant cache hit.
[2023-03-12 20:29:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 20:29:51] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:51] [INFO ] Invariant cache hit.
[2023-03-12 20:29:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-12 20:29:52] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-12 20:29:52] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 20:29:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-12 20:29:52] [INFO ] Invariant cache hit.
[2023-03-12 20:29:52] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-PT-6-UpperBounds-02 in 4668 ms.
[2023-03-12 20:29:52] [INFO ] Flatten gal took : 63 ms
[2023-03-12 20:29:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 20:29:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 342 transitions and 1638 arcs took 4 ms.
Total runtime 27242 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LamportFastMutEx (PT), instance 6
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 158 places, 342 transitions, 1638 arcs.
Final Score: 5117.756
Took : 14 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678656269395

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 873 Killed ${SMART}/smart ${INPUT_SM}

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-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is LamportFastMutEx-PT-6, 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 r235-tall-167856421800429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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