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.r229-tall-167856413200405.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 itstools
Input is LamportFastMutEx-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 13K Feb 25 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 233K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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 77K 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-3-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679481630088

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 10:40:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 10:40:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:40:31] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-22 10:40:31] [INFO ] Transformed 100 places.
[2023-03-22 10:40:31] [INFO ] Transformed 156 transitions.
[2023-03-22 10:40:31] [INFO ] Found NUPN structural information;
[2023-03-22 10:40:31] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3]
[2023-03-22 10:40:31] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-PT-3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 96 out of 114 initially.
// Phase 1: matrix 96 rows 71 cols
[2023-03-22 10:40:31] [INFO ] Computed 17 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :21
FORMULA LamportFastMutEx-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-05 3 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 4) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :11
[2023-03-22 10:40:32] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2023-03-22 10:40:32] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-22 10:40:33] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 10:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:33] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-22 10:40:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 10:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:40:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-22 10:40:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:40:33] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 648 ms
[2023-03-22 10:40:34] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Real]Added 27 Read/Feed constraints in 2 ms returned sat
[2023-03-22 10:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 315 ms
[2023-03-22 10:40:34] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 10:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:34] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 15 ms returned sat
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2023-03-22 10:40:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 219 ms
[2023-03-22 10:40:34] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 10:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:35] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 10:40:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 10:40:35] [INFO ] Computed and/alt/rep : 93/306/87 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2023-03-22 10:40:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 255 ms
[2023-03-22 10:40:35] [INFO ] Added : 54 causal constraints over 12 iterations in 370 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [6, 2, 2, 3] Max seen :[6, 2, 2, 1]
FORMULA LamportFastMutEx-PT-3-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 22 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 65/71 places, 108/114 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 65 cols
[2023-03-22 10:40:35] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=2114 ) properties (out of 1) seen :1
[2023-03-22 10:40:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 65 cols
[2023-03-22 10:40:37] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-22 10:40:37] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 10:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 10:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 10:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 10:40:37] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-22 10:40:37] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:40:37] [INFO ] Computed and/alt/rep : 78/291/78 causal constraints (skipped 9 transitions) in 5 ms.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2023-03-22 10:40:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 300 ms
[2023-03-22 10:40:37] [INFO ] Added : 33 causal constraints over 8 iterations in 375 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 65/65 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 10:40:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:37] [INFO ] Invariant cache hit.
[2023-03-22 10:40:37] [INFO ] Implicit Places using invariants in 93 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/65 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101 ms. Remains : 62/65 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:37] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :1
[2023-03-22 10:40:39] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 10:40:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 10:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 10:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-22 10:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 10:40:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:40:39] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2023-03-22 10:40:39] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 5 ms.
[2023-03-22 10:40:39] [INFO ] Added : 26 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 10:40:39] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:39] [INFO ] Invariant cache hit.
[2023-03-22 10:40:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-22 10:40:39] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:39] [INFO ] Invariant cache hit.
[2023-03-22 10:40:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:40:39] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-22 10:40:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 10:40:39] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:39] [INFO ] Invariant cache hit.
[2023-03-22 10:40:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 62/62 places, 108/108 transitions.
Starting property specific reduction for LamportFastMutEx-PT-3-UpperBounds-07
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:39] [INFO ] Computed 14 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-22 10:40:39] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:39] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-22 10:40:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 10:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 10:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 10:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 10:40:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:40:39] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:40:39] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 5 ms.
[2023-03-22 10:40:39] [INFO ] Added : 26 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:39] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 1) seen :1
[2023-03-22 10:40:41] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 10:40:41] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 10:40:41] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 10:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 10:40:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:40:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 10:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:40:41] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 10:40:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:40:41] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2023-03-22 10:40:41] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 5 ms.
[2023-03-22 10:40:41] [INFO ] Added : 26 causal constraints over 6 iterations in 54 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 10:40:41] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:41] [INFO ] Invariant cache hit.
[2023-03-22 10:40:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-22 10:40:41] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:41] [INFO ] Invariant cache hit.
[2023-03-22 10:40:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 10:40:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-22 10:40:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 10:40:41] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 10:40:41] [INFO ] Invariant cache hit.
[2023-03-22 10:40:41] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 62/62 places, 108/108 transitions.
Ending property specific reduction for LamportFastMutEx-PT-3-UpperBounds-07 in 2037 ms.
[2023-03-22 10:40:41] [INFO ] Flatten gal took : 36 ms
[2023-03-22 10:40:41] [INFO ] Applying decomposition
[2023-03-22 10:40:41] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1822496614844401501.txt' '-o' '/tmp/graph1822496614844401501.bin' '-w' '/tmp/graph1822496614844401501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1822496614844401501.bin' '-l' '-1' '-v' '-w' '/tmp/graph1822496614844401501.weights' '-q' '0' '-e' '0.001'
[2023-03-22 10:40:41] [INFO ] Decomposing Gal with order
[2023-03-22 10:40:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 10:40:42] [INFO ] Removed a total of 119 redundant transitions.
[2023-03-22 10:40:42] [INFO ] Flatten gal took : 67 ms
[2023-03-22 10:40:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2023-03-22 10:40:42] [INFO ] Time to serialize gal into /tmp/UpperBounds4764025639804825031.gal : 16 ms
[2023-03-22 10:40:42] [INFO ] Time to serialize properties into /tmp/UpperBounds3954051750699197417.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4764025639804825031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3954051750699197417.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds3954051750699197417.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,15512,0.208054,12160,2,3706,5,30956,6,0,372,37860,0
Total reachable state count : 15512

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-PT-3-UpperBounds-07 :0 <= gi5.gu12.P_CS_21_1+gi3.gu13.P_CS_21_2+gi5.gu14.P_CS_21_3 <= 1
FORMULA LamportFastMutEx-PT-3-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-3-UpperBounds-07,0,0.211153,12160,1,0,7,30956,9,1,537,37860,4
Total runtime 10900 ms.

BK_STOP 1679481647987

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-3"
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-5348"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-3, 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 r229-tall-167856413200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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