Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820900421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r132-tall-165271820900421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 18K Apr 29 19:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 29 19:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 29 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Apr 29 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 157K May 10 09:34 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 1652785592667

Running Version 202205111006
[2022-05-17 11:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 11:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:06:33] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-17 11:06:33] [INFO ] Transformed 174 places.
[2022-05-17 11:06:33] [INFO ] Transformed 318 transitions.
[2022-05-17 11:06:33] [INFO ] Found NUPN structural information;
[2022-05-17 11:06:33] [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]
[2022-05-17 11:06:33] [INFO ] Parsed PT model containing 174 places and 318 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 200 out of 260 initially.
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 11:06:34] [INFO ] Computed 37 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :25
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 :15
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 :6
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 :13
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :14
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 11:06:34] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 11:06:34] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-17 11:06:34] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2022-05-17 11:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:34] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-17 11:06:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:06:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2022-05-17 11:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:34] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-17 11:06:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 11:06:34] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2022-05-17 11:06:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2022-05-17 11:06:34] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2022-05-17 11:06:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2022-05-17 11:06:34] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-05-17 11:06:34] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 660 ms
[2022-05-17 11:06:35] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2022-05-17 11:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-17 11:06:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:06:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2022-05-17 11:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:35] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-17 11:06:35] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-05-17 11:06:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 509 ms
[2022-05-17 11:06:35] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-17 11:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:36] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-17 11:06:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:06:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2022-05-17 11:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:36] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-17 11:06:36] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2022-05-17 11:06:36] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 15 ms.
[2022-05-17 11:06:36] [INFO ] Added : 48 causal constraints over 10 iterations in 204 ms. Result :sat
Minimization took 41 ms.
[2022-05-17 11:06:36] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2022-05-17 11:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:36] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-17 11:06:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:06:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2022-05-17 11:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:36] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-17 11:06:36] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2022-05-17 11:06:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 297 ms
[2022-05-17 11:06:36] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 12 ms.
[2022-05-17 11:06:37] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-17 11:06:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2022-05-17 11:06:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-17 11:06:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2022-05-17 11:06:37] [INFO ] Added : 63 causal constraints over 13 iterations in 418 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 5, 5] Max seen :[4, 4, 4, 2]
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 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-02 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 137 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 52 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/137 places, 255/260 transitions.
Normalized transition count is 195 out of 255 initially.
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 11:06:37] [INFO ] Computed 37 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1674 ms. (steps per millisecond=597 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :4
[2022-05-17 11:06:39] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 11:06:39] [INFO ] Computed 37 place invariants in 8 ms
[2022-05-17 11:06:39] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-17 11:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:39] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-17 11:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:06:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-17 11:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:06:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-17 11:06:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 11:06:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2022-05-17 11:06:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 537 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6779 ms.

BK_STOP 1652785600590

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r132-tall-165271820900421"
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 ;