Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 24K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 228K Feb 25 13:44 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 52K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 321K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K 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 329K 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-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 1678751383465

Running Version 202205111006
[2023-03-13 23:49:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:49:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:49:44] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-13 23:49:44] [INFO ] Transformed 315 places.
[2023-03-13 23:49:44] [INFO ] Transformed 666 transitions.
[2023-03-13 23:49:44] [INFO ] Found NUPN structural information;
[2023-03-13 23:49:44] [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]
[2023-03-13 23:49:44] [INFO ] Parsed PT model containing 315 places and 666 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2023-03-13 23:49:45] [INFO ] Computed 82 place invariants in 25 ms
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :58
FORMULA LamportFastMutEx-PT-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :42
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :53
FORMULA LamportFastMutEx-PT-8-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 23:49:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-13 23:49:45] [INFO ] Computed 82 place invariants in 5 ms
[2023-03-13 23:49:45] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-13 23:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:45] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-13 23:49:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2023-03-13 23:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:45] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-13 23:49:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-13 23:49:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
[2023-03-13 23:49:45] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 11 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-13 23:49:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 903 ms
[2023-03-13 23:49:46] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2023-03-13 23:49:47] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-03-13 23:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-13 23:49:47] [INFO ] Added : 41 causal constraints over 9 iterations in 481 ms. Result :sat
Minimization took 106 ms.
[2023-03-13 23:49:47] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2023-03-13 23:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:47] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-13 23:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:47] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2023-03-13 23:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:47] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 23:49:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 52 ms returned sat
[2023-03-13 23:49:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:49:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 993 ms
[2023-03-13 23:49:48] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-13 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:49:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:48] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-13 23:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:49] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 23:49:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 35 ms returned sat
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:49:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1903 ms
[2023-03-13 23:49:51] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-13 23:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:51] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-13 23:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2023-03-13 23:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:51] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 23:49:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-13 23:49:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:49:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1169 ms
[2023-03-13 23:49:52] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 37 ms.
[2023-03-13 23:49:53] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2023-03-13 23:49:53] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-03-13 23:49:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2023-03-13 23:49:53] [INFO ] Added : 93 causal constraints over 20 iterations in 1025 ms. Result :sat
Minimization took 122 ms.
[2023-03-13 23:49:53] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-13 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-13 23:49:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-13 23:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:54] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 23:49:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 55 ms returned sat
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 789 ms
[2023-03-13 23:49:54] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 33 ms.
[2023-03-13 23:49:55] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-13 23:49:55] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:49:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:49:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:49:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:49:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 517 ms
[2023-03-13 23:49:56] [INFO ] Added : 122 causal constraints over 26 iterations in 1391 ms. Result :sat
Minimization took 224 ms.
Current structural bounds on expressions (after SMT) : [8, 7, 7, 8, 64] Max seen :[4, 7, 7, 6, 38]
FORMULA LamportFastMutEx-PT-8-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 37 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2023-03-13 23:49:57] [INFO ] Computed 82 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3070 ms. (steps per millisecond=325 ) properties (out of 3) seen :64
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 3) seen :58
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 3) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2003 ms. (steps per millisecond=499 ) properties (out of 3) seen :64
[2023-03-13 23:50:04] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-13 23:50:04] [INFO ] Computed 82 place invariants in 7 ms
[2023-03-13 23:50:04] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-13 23:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-13 23:50:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:04] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-13 23:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:04] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 23:50:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-13 23:50:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:50:04] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-13 23:50:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1495 ms
[2023-03-13 23:50:05] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-13 23:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:06] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-13 23:50:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-13 23:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:06] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 23:50:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:50:06] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-13 23:50:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 1708 ms
[2023-03-13 23:50:08] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-13 23:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:08] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-13 23:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-13 23:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 23:50:08] [INFO ] [Nat]Added 112 Read/Feed constraints in 59 ms returned sat
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:50:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-13 23:50:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 1676 ms
Current structural bounds on expressions (after SMT) : [7, 7, 56] Max seen :[7, 7, 56]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25377 ms.

BK_STOP 1678751410097

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is LamportFastMutEx-PT-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 r255-tall-167856440300056"
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.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 ;