Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 157K 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-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679494845943

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 14:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:20:47] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-22 14:20:47] [INFO ] Transformed 174 places.
[2023-03-22 14:20:47] [INFO ] Transformed 318 transitions.
[2023-03-22 14:20:47] [INFO ] Found NUPN structural information;
[2023-03-22 14:20:47] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, 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_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, 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_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, 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_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, 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_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, 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_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, 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_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, 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_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_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, 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_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, 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_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, 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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, 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_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2023-03-22 14:20:47] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 200 out of 260 initially.
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 14:20:47] [INFO ] Computed 37 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :35
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :19
[2023-03-22 14:20:47] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 14:20:47] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-22 14:20:48] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2023-03-22 14:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:48] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 14:20:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-22 14:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:48] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-22 14:20:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 14:20:48] [INFO ] [Nat]Added 55 Read/Feed constraints in 37 ms returned sat
[2023-03-22 14:20:48] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
[2023-03-22 14:20:48] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-22 14:20:48] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-22 14:20:48] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-22 14:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1031 ms
[2023-03-22 14:20:49] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 14:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:49] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 14:20:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 14:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:49] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 14:20:49] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-22 14:20:49] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 26 ms.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-22 14:20:50] [INFO ] Added : 67 causal constraints over 15 iterations in 447 ms. Result :sat
Minimization took 72 ms.
[2023-03-22 14:20:50] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 14:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:50] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-22 14:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2023-03-22 14:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:50] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 14:20:50] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-22 14:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 514 ms
[2023-03-22 14:20:51] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 14:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-22 14:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 14:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:51] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 14:20:51] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 14:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 574 ms
[2023-03-22 14:20:51] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 14:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-22 14:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-22 14:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:51] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 14:20:52] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-22 14:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 670 ms
[2023-03-22 14:20:52] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 14:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:52] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-22 14:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 14:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 14:20:52] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 14:20:52] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 13 ms.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2023-03-22 14:20:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 677 ms
[2023-03-22 14:20:53] [INFO ] Added : 79 causal constraints over 18 iterations in 968 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [4, 5, 4, 4, 4, 5] Max seen :[4, 3, 4, 4, 4, 1]
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 40 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 127/137 places, 250/260 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 14:20:54] [INFO ] Computed 37 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1704 ms. (steps per millisecond=586 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 1) seen :1
[2023-03-22 14:20:56] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 14:20:56] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-22 14:20:56] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 14:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:56] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 14:20:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 14:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:56] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 14:20:56] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 14:20:56] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 14:20:56] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 16 ms.
[2023-03-22 14:20:56] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 14:20:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2023-03-22 14:20:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-22 14:20:56] [INFO ] Added : 43 causal constraints over 9 iterations in 249 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 14:20:57] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:20:57] [INFO ] Invariant cache hit.
[2023-03-22 14:20:57] [INFO ] Implicit Places using invariants in 125 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 129 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 148 ms. Remains : 122/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:20:57] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1661 ms. (steps per millisecond=602 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :1
[2023-03-22 14:20:59] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:20:59] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-22 14:20:59] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 14:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:59] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 14:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:20:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 14:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-22 14:20:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 14:20:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 14:20:59] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-22 14:20:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 14:21:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 14:21:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-22 14:21:00] [INFO ] Added : 86 causal constraints over 18 iterations in 367 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 14:21:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:00] [INFO ] Invariant cache hit.
[2023-03-22 14:21:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 14:21:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:00] [INFO ] Invariant cache hit.
[2023-03-22 14:21:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 14:21:00] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-22 14:21:00] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 14:21:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:00] [INFO ] Invariant cache hit.
[2023-03-22 14:21:00] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 122/122 places, 250/250 transitions.
Starting property specific reduction for LamportFastMutEx-PT-5-UpperBounds-07
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:21:00] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-22 14:21:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:21:00] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-22 14:21:00] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 14:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 14:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 14:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:00] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 14:21:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 14:21:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-22 14:21:00] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 15 ms.
[2023-03-22 14:21:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 14:21:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 14:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-22 14:21:01] [INFO ] Added : 86 causal constraints over 18 iterations in 370 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 23 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 122/122 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:21:01] [INFO ] Computed 32 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1528 ms. (steps per millisecond=654 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 1) seen :1
[2023-03-22 14:21:03] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 14:21:03] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-22 14:21:03] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 14:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:03] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 14:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 14:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 14:21:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 14:21:03] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 14:21:03] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 14:21:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 14:21:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 14:21:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-22 14:21:04] [INFO ] Added : 86 causal constraints over 18 iterations in 375 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 14:21:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:04] [INFO ] Invariant cache hit.
[2023-03-22 14:21:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-22 14:21:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:04] [INFO ] Invariant cache hit.
[2023-03-22 14:21:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 14:21:04] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-22 14:21:04] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 14:21:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 14:21:04] [INFO ] Invariant cache hit.
[2023-03-22 14:21:04] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 122/122 places, 250/250 transitions.
Ending property specific reduction for LamportFastMutEx-PT-5-UpperBounds-07 in 4068 ms.
[2023-03-22 14:21:04] [INFO ] Flatten gal took : 51 ms
[2023-03-22 14:21:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 104 ms.
[2023-03-22 14:21:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 250 transitions and 1160 arcs took 5 ms.
Total runtime 17697 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: LamportFastMutEx_PT_5
(NrP: 122 NrTr: 250 NrArc: 1160)

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

net check time: 0m 0.000sec

init dd package: 0m 2.828sec


RS generation: 9m15.463sec


-> reachability set: #nodes 479359 (4.8e+05) #states 435,092,592 (8)



starting MCC model checker
--------------------------

checking: place_bound(p112,p113,p114,p115,p116)
normalized: place_bound(p112,p113,p114,p115,p116)

-> the formula is 1

FORMULA LamportFastMutEx-PT-5-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 35406453 (3.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 276880720 1780924819 2057805539
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 110410 535045 645455
used/not used/entry size/cache size: 901265 15875951 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 67457 479847 547304
used/not used/entry size/cache size: 466492 7922116 32 256MB
max state cache: hits/miss/sum: 67457 479847 547304
used/not used/entry size/cache size: 466492 7922116 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 42359577
1 16674066
2 5990118
3 1666167
4 351132
5 58835
6 7950
7 925
8 75
9 18
>= 10 1

Total processing time: 9m23.181sec


BK_STOP 1679495429413

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

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


initing FirstDep: 0m 0.000sec

18756 88337 137122 227958 317004 470504
iterations count:664243 (2656), effective:13396 (53)

initing FirstDep: 0m 0.000sec

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-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LamportFastMutEx-PT-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420300421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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