Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500343.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is LamportFastMutEx-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 515K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 988K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 07:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 25 07:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 265K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620933640074

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:20:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 19:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:20:41] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-13 19:20:41] [INFO ] Transformed 264 places.
[2021-05-13 19:20:41] [INFO ] Transformed 536 transitions.
[2021-05-13 19:20:41] [INFO ] Found NUPN structural information;
[2021-05-13 19:20:41] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2021-05-13 19:20:41] [INFO ] Parsed PT model containing 264 places and 536 transitions in 136 ms.
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 74 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0]
[2021-05-13 19:20:41] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2021-05-13 19:20:41] [INFO ] Computed 65 place invariants in 11 ms
[2021-05-13 19:20:41] [INFO ] [Real]Absence check using 65 positive place invariants in 39 ms returned sat
[2021-05-13 19:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:20:42] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-13 19:20:42] [INFO ] State equation strengthened by 105 read => feed constraints.
[2021-05-13 19:20:42] [INFO ] [Real]Added 105 Read/Feed constraints in 20 ms returned sat
[2021-05-13 19:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:20:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 43 ms returned sat
[2021-05-13 19:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:20:42] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-13 19:20:42] [INFO ] [Nat]Added 105 Read/Feed constraints in 19 ms returned sat
[2021-05-13 19:20:42] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2021-05-13 19:20:42] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2021-05-13 19:20:42] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2021-05-13 19:20:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2021-05-13 19:20:42] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 29 ms.
[2021-05-13 19:20:45] [INFO ] Added : 307 causal constraints over 62 iterations in 2160 ms. Result :sat
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 9 places in 51 ms
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-13 19:20:45] [INFO ] Deduced a trap composed of 9 places in 14 ms
[2021-05-13 19:20:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 639 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
Incomplete Parikh walk after 92700 steps, including 1000 resets, run finished after 335 ms. (steps per millisecond=276 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 65 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/219 places, 448/462 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2868 ms. (steps per millisecond=348 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties seen :[0]
Interrupted probabilistic random walk after 12929090 steps, run timeout after 30001 ms. (steps per millisecond=430 ) properties seen :[0]
Probabilistic random walk after 12929090 steps, saw 1948650 distinct states, run finished after 30001 ms. (steps per millisecond=430 ) properties seen :[0]
[2021-05-13 19:21:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2021-05-13 19:21:20] [INFO ] Computed 65 place invariants in 3 ms
[2021-05-13 19:21:20] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-13 19:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:21:20] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-13 19:21:20] [INFO ] State equation strengthened by 105 read => feed constraints.
[2021-05-13 19:21:20] [INFO ] [Real]Added 105 Read/Feed constraints in 28 ms returned sat
[2021-05-13 19:21:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:21:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 29 ms returned sat
[2021-05-13 19:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:21:20] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-13 19:21:20] [INFO ] [Nat]Added 105 Read/Feed constraints in 14 ms returned sat
[2021-05-13 19:21:20] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2021-05-13 19:21:20] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2021-05-13 19:21:21] [INFO ] Deduced a trap composed of 12 places in 120 ms
[2021-05-13 19:21:21] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-13 19:21:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2021-05-13 19:21:21] [INFO ] Computed and/alt/rep : 441/4123/315 causal constraints in 24 ms.
[2021-05-13 19:21:23] [INFO ] Added : 303 causal constraints over 61 iterations in 1991 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 104500 steps, including 1000 resets, run finished after 315 ms. (steps per millisecond=331 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 16 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2021-05-13 19:21:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2021-05-13 19:21:23] [INFO ] Computed 65 place invariants in 2 ms
[2021-05-13 19:21:23] [INFO ] Implicit Places using invariants in 256 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 257 ms to find 7 implicit places.
[2021-05-13 19:21:23] [INFO ] Redundant transitions in 25 ms returned []
[2021-05-13 19:21:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:21:23] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-13 19:21:24] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Starting structural reductions, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2021-05-13 19:21:24] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-13 19:21:24] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:21:24] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-13 19:21:24] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Finished structural reductions, in 2 iterations. Remains : 198/205 places, 448/448 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2839 ms. (steps per millisecond=352 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties seen :[0]
Interrupted probabilistic random walk after 13200921 steps, run timeout after 30001 ms. (steps per millisecond=440 ) properties seen :[0]
Probabilistic random walk after 13200921 steps, saw 1991648 distinct states, run finished after 30001 ms. (steps per millisecond=440 ) properties seen :[0]
[2021-05-13 19:21:58] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:21:58] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-13 19:21:58] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2021-05-13 19:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:21:58] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-13 19:21:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-13 19:21:58] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2021-05-13 19:21:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:21:58] [INFO ] [Nat]Absence check using 58 positive place invariants in 30 ms returned sat
[2021-05-13 19:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:21:58] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-13 19:21:58] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2021-05-13 19:21:58] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 32 places in 87 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 26 places in 76 ms
[2021-05-13 19:21:59] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 29 places in 88 ms
[2021-05-13 19:22:00] [INFO ] Deduced a trap composed of 28 places in 90 ms
[2021-05-13 19:22:00] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1718 ms
[2021-05-13 19:22:00] [INFO ] Computed and/alt/rep : 441/3913/315 causal constraints in 24 ms.
[2021-05-13 19:22:02] [INFO ] Added : 263 causal constraints over 53 iterations in 1708 ms. Result :sat
[2021-05-13 19:22:02] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2021-05-13 19:22:02] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2021-05-13 19:22:02] [INFO ] Deduced a trap composed of 7 places in 85 ms
[2021-05-13 19:22:02] [INFO ] Deduced a trap composed of 26 places in 76 ms
[2021-05-13 19:22:02] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 33 places in 81 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 27 places in 83 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2021-05-13 19:22:03] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2021-05-13 19:22:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1491 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 78800 steps, including 1000 resets, run finished after 249 ms. (steps per millisecond=316 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2021-05-13 19:22:04] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:22:04] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-13 19:22:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2021-05-13 19:22:04] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:22:04] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-13 19:22:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-13 19:22:05] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2021-05-13 19:22:05] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 19:22:05] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:22:05] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-13 19:22:05] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 448/448 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 333 ms. (steps per millisecond=300 ) properties seen :[0]
[2021-05-13 19:22:05] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2021-05-13 19:22:05] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-13 19:22:05] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-13 19:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:22:06] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-13 19:22:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-13 19:22:06] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2021-05-13 19:22:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:22:06] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2021-05-13 19:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:22:06] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-13 19:22:06] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 30 places in 85 ms
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 32 places in 85 ms
[2021-05-13 19:22:06] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 26 places in 83 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-13 19:22:07] [INFO ] Deduced a trap composed of 29 places in 88 ms
[2021-05-13 19:22:08] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2021-05-13 19:22:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1654 ms
[2021-05-13 19:22:08] [INFO ] Computed and/alt/rep : 441/3913/315 causal constraints in 23 ms.
[2021-05-13 19:22:09] [INFO ] Added : 263 causal constraints over 53 iterations in 1700 ms. Result :sat
[2021-05-13 19:22:09] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2021-05-13 19:22:09] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 33 places in 82 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2021-05-13 19:22:10] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2021-05-13 19:22:11] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2021-05-13 19:22:11] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2021-05-13 19:22:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1478 ms
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 198 transition count 322
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 198 transition count 273
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 107 transition count 273
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 259
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 294 place count 93 transition count 259
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 93 transition count 259
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Applied a total of 308 rules in 21 ms. Remains 93 /198 variables (removed 105) and now considering 252/448 (removed 196) transitions.
// Phase 1: matrix 252 rows 93 cols
[2021-05-13 19:22:11] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-13 19:22:11] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-13 19:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:22:11] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-13 19:22:11] [INFO ] Computed and/alt/rep : 238/1904/238 causal constraints in 14 ms.
[2021-05-13 19:22:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:22:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2021-05-13 19:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:22:11] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-13 19:22:11] [INFO ] Computed and/alt/rep : 238/1904/238 causal constraints in 13 ms.
[2021-05-13 19:22:12] [INFO ] Added : 196 causal constraints over 40 iterations in 801 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-13 19:22:12] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-13 19:22:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-13 19:22:12] [INFO ] Flatten gal took : 70 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-7 @ 3570 seconds
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-PT-7

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 19:22:13 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 21788,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p50 + p49 + p48 + p47 + p46 + p45 + p44))))",
"processed_size": 189,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2212,
"conflict_clusters": 9,
"places": 198,
"places_significant": 140,
"singleton_clusters": 0,
"transitions": 448
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 646/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 198
lola: finding significant places
lola: 198 places, 448 transitions, 140 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p50 + p49 + p48 + p47 + p46 + p45 + p44))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p50 + p49 + p48 + p47 + p46 + p45 + p44))))
lola: processed formula length: 189
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: local time limit reached - aborting
lola: formula 0: ((3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p50 + p49 + p48 + p47 + p46 + p45 + p44))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: memory consumption: 21788 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is LamportFastMutEx-PT-7, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;