Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 29K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 263K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 310K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 582K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 329K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748776067180

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:07:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:07:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:07:48] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-01 11:07:48] [INFO ] Transformed 315 places.
[2025-06-01 11:07:48] [INFO ] Transformed 666 transitions.
[2025-06-01 11:07:48] [INFO ] Found NUPN structural information;
[2025-06-01 11:07:48] [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_start_1_8, 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_b_8_false, P_b_8_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_setx_3_8, 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_setbi_5_8, 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_ify0_4_8, 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_sety_9_8, 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_ifxi_10_8, 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_setbi_11_8, 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_fordo_12_8, 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_0_8, 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_1_8, 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_2_8, 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_3_8, 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_4_8, 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_5_8, 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_6_8, 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_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, 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_await_13_8, 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_0_8, 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_1_8, 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_2_8, 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_3_8, 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_4_8, 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_5_8, 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_6_8, 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_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, 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_ifyi_15_8, 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_awaity_8, 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_CS_21_8, 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, P_setbi_24_8]
[2025-06-01 11:07:48] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 49 places in 10 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 11:07:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2025-06-01 11:07:48] [INFO ] Computed 82 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 58 ms. (169 steps per ms)
FORMULA LamportFastMutEx-PT-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 7, 7] Max Struct:[8, 8, 8, 8]
[2025-06-01 11:07:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-01 11:07:48] [INFO ] Invariant cache hit.
[2025-06-01 11:07:49] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-01 11:07:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:07:49] [INFO ] [Real]Added 112 Read/Feed constraints in 12 ms returned sat
[2025-06-01 11:07:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 8 ms to minimize.
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 758 ms
[2025-06-01 11:07:50] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 3 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 350 ms
[2025-06-01 11:07:50] [INFO ] Added : 37 causal constraints over 9 iterations in 673 ms. Result :sat
Minimization took 157 ms.
[2025-06-01 11:07:51] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:07:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2025-06-01 11:07:51] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 458 ms
[2025-06-01 11:07:52] [INFO ] Added : 92 causal constraints over 19 iterations in 1108 ms. Result :sat
Minimization took 187 ms.
[2025-06-01 11:07:52] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:07:52] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 11:07:52] [INFO ] [Real]Added 112 Read/Feed constraints in 12 ms returned sat
[2025-06-01 11:07:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:07:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 11:07:53] [INFO ] [Nat]Added 112 Read/Feed constraints in 23 ms returned sat
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1236 ms
[2025-06-01 11:07:54] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:07:54] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 11:07:54] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:07:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:07:54] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-06-01 11:07:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 5 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 6 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2491 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 7, 7] Max Struct:[8, 8, 7, 7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 6] Max Struct:[8, 8]
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 101 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 250/266 places, 568/584 transitions.
[2025-06-01 11:07:57] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2025-06-01 11:07:57] [INFO ] Computed 82 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 6] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 2585 ms. (386 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1383 ms. (1445 steps per ms)
FORMULA LamportFastMutEx-PT-8-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-01 11:08:01] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:08:01] [INFO ] Invariant cache hit.
[2025-06-01 11:08:02] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:08:02] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-01 11:08:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:08:02] [INFO ] [Real]Added 112 Read/Feed constraints in 16 ms returned sat
[2025-06-01 11:08:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:08:02] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 11:08:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1082 ms
[2025-06-01 11:08:03] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 33 ms.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2025-06-01 11:08:03] [INFO ] Added : 40 causal constraints over 8 iterations in 587 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 27 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-01 11:08:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:08:04] [INFO ] Invariant cache hit.
[2025-06-01 11:08:04] [INFO ] Implicit Places using invariants in 271 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 275 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 305 ms. Remains : 242/250 places, 568/568 transitions.
[2025-06-01 11:08:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-01 11:08:04] [INFO ] Computed 74 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2286 ms. (437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 752 ms. (1328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2025-06-01 11:08:07] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:08:07] [INFO ] Invariant cache hit.
[2025-06-01 11:08:07] [INFO ] [Real]Absence check using 74 positive place invariants in 14 ms returned sat
[2025-06-01 11:08:07] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 11:08:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-01 11:08:07] [INFO ] [Real]Added 48 Read/Feed constraints in 13 ms returned sat
[2025-06-01 11:08:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:07] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2025-06-01 11:08:08] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-01 11:08:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1357 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 11:08:09] [INFO ] Flatten gal took : 80 ms
[2025-06-01 11:08:09] [INFO ] Flatten gal took : 38 ms
[2025-06-01 11:08:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2207687376525842720.gal : 24 ms
[2025-06-01 11:08:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12441225994015970497.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2207687376525842720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12441225994015970497.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21441 ms.

BK_STOP 1748776089869

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-8"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is LamportFastMutEx-PT-8, 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 r125-tall-174876435800088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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