About the Execution of ITS-Tools for LamportFastMutEx-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 696.600 | 35956.00 | 46936.00 | 631.80 | 4 5 4 5 4 4 5 1 1 1 1 0 1 1 1 1 | normal |
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-167856413200421.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-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200421
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679482664559
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-5
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 10:57:46] [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:57:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:57:46] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-22 10:57:46] [INFO ] Transformed 174 places.
[2023-03-22 10:57:46] [INFO ] Transformed 318 transitions.
[2023-03-22 10:57:46] [INFO ] Found NUPN structural information;
[2023-03-22 10:57:46] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2023-03-22 10:57:46] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 200 out of 260 initially.
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 10:57:46] [INFO ] Computed 37 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :35
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) 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 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :24
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :19
[2023-03-22 10:57:46] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 10:57:46] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-22 10:57:46] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2023-03-22 10:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:46] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 10:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-22 10:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:46] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 10:57:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 10:57:46] [INFO ] [Nat]Added 55 Read/Feed constraints in 13 ms returned sat
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:57:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 617 ms
[2023-03-22 10:57:47] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 10:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:47] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-22 10:57:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:47] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 10:57:47] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-22 10:57:47] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 17 ms.
[2023-03-22 10:57:47] [INFO ] Added : 48 causal constraints over 10 iterations in 184 ms. Result :sat
Minimization took 46 ms.
[2023-03-22 10:57:48] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 10:57:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:57:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 524 ms
[2023-03-22 10:57:48] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 10:57:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:48] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 10:57:48] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 10:57:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 545 ms
[2023-03-22 10:57:49] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:49] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-22 10:57:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:49] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 10:57:49] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2023-03-22 10:57:49] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:57:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 759 ms
[2023-03-22 10:57:50] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-22 10:57:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-22 10:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:50] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 10:57:50] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 10:57:50] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 15 ms.
[2023-03-22 10:57:50] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:57:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 746 ms
[2023-03-22 10:57:51] [INFO ] Added : 79 causal constraints over 18 iterations in 1051 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [4, 5, 4, 4, 4, 5] Max seen :[4, 4, 4, 4, 4, 1]
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 40 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 127/137 places, 250/260 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 10:57:52] [INFO ] Computed 37 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 2) seen :6
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :1
[2023-03-22 10:57:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 10:57:54] [INFO ] Computed 37 place invariants in 7 ms
[2023-03-22 10:57:54] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:54] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 10:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-22 10:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:54] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 10:57:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 10:57:54] [INFO ] [Nat]Added 55 Read/Feed constraints in 15 ms returned sat
[2023-03-22 10:57:54] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 15 ms.
[2023-03-22 10:57:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:57:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2023-03-22 10:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2023-03-22 10:57:54] [INFO ] Added : 43 causal constraints over 9 iterations in 245 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 20 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 127/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 10:57:55] [INFO ] Computed 37 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 1) seen :1
[2023-03-22 10:57:57] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 10:57:57] [INFO ] Computed 37 place invariants in 7 ms
[2023-03-22 10:57:57] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 10:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 10:57:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:57:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 10:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:57:57] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 10:57:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 10:57:57] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 10:57:57] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 15 ms.
[2023-03-22 10:57:57] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:57:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 10:57:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-22 10:57:57] [INFO ] Added : 43 causal constraints over 9 iterations in 257 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 10:57:57] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:57:57] [INFO ] Invariant cache hit.
[2023-03-22 10:57:57] [INFO ] Implicit Places using invariants in 145 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 147 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 165 ms. Remains : 122/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:57:57] [INFO ] Computed 32 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1513 ms. (steps per millisecond=660 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :1
[2023-03-22 10:58:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:58:00] [INFO ] Computed 32 place invariants in 6 ms
[2023-03-22 10:58:00] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 10:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:00] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 10:58:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:58:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-22 10:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:00] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 10:58:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:58:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:58:00] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 10:58:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:58:00] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 5 ms to minimize.
[2023-03-22 10:58:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-22 10:58:00] [INFO ] Added : 86 causal constraints over 18 iterations in 354 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 10:58:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:00] [INFO ] Invariant cache hit.
[2023-03-22 10:58:00] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 10:58:00] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:00] [INFO ] Invariant cache hit.
[2023-03-22 10:58:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:58:01] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-22 10:58:01] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 10:58:01] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:01] [INFO ] Invariant cache hit.
[2023-03-22 10:58:01] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 122/122 places, 250/250 transitions.
Starting property specific reduction for LamportFastMutEx-PT-5-UpperBounds-07
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:58:01] [INFO ] Computed 32 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-22 10:58:01] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:58:01] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-22 10:58:01] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 10:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:01] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 10:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:58:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-22 10:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:01] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 10:58:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:58:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:58:01] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 10:58:01] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:58:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 10:58:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-22 10:58:01] [INFO ] Added : 86 causal constraints over 18 iterations in 378 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 18 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 122/122 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:58:01] [INFO ] Computed 32 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 1) seen :1
[2023-03-22 10:58:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 10:58:04] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-22 10:58:04] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 10:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:04] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 10:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:58:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 10:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:58:04] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 10:58:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:58:04] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:58:04] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 18 ms.
[2023-03-22 10:58:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 4 ms to minimize.
[2023-03-22 10:58:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 10:58:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-03-22 10:58:04] [INFO ] Added : 86 causal constraints over 18 iterations in 367 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 10:58:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:04] [INFO ] Invariant cache hit.
[2023-03-22 10:58:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 10:58:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:04] [INFO ] Invariant cache hit.
[2023-03-22 10:58:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 10:58:05] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-22 10:58:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 10:58:05] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 10:58:05] [INFO ] Invariant cache hit.
[2023-03-22 10:58:05] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 122/122 places, 250/250 transitions.
Ending property specific reduction for LamportFastMutEx-PT-5-UpperBounds-07 in 4034 ms.
[2023-03-22 10:58:05] [INFO ] Flatten gal took : 49 ms
[2023-03-22 10:58:05] [INFO ] Applying decomposition
[2023-03-22 10:58:05] [INFO ] Flatten gal took : 19 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/graph6059297621965329301.txt' '-o' '/tmp/graph6059297621965329301.bin' '-w' '/tmp/graph6059297621965329301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6059297621965329301.bin' '-l' '-1' '-v' '-w' '/tmp/graph6059297621965329301.weights' '-q' '0' '-e' '0.001'
[2023-03-22 10:58:05] [INFO ] Decomposing Gal with order
[2023-03-22 10:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 10:58:05] [INFO ] Removed a total of 318 redundant transitions.
[2023-03-22 10:58:05] [INFO ] Flatten gal took : 55 ms
[2023-03-22 10:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 8 ms.
[2023-03-22 10:58:05] [INFO ] Time to serialize gal into /tmp/UpperBounds3710418987144057776.gal : 6 ms
[2023-03-22 10:58:05] [INFO ] Time to serialize properties into /tmp/UpperBounds15530441125944907122.prop : 1 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/UpperBounds3710418987144057776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15530441125944907122.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 ...305
Loading property file /tmp/UpperBounds15530441125944907122.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,4.35093e+08,13.0237,340044,2,59804,5,1.04471e+06,6,0,764,1.67072e+06,0
Total reachable state count : 435092592
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-PT-5-UpperBounds-07 :0 <= gi0.gu19.P_CS_21_1+gi7.gu20.P_CS_21_2+gi1.gu23.P_CS_21_3+gi3.gu21.P_CS_21_4+gi7.gu22.P_CS_21_5 <...158
FORMULA LamportFastMutEx-PT-5-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-5-UpperBounds-07,0,13.0637,340044,1,0,7,1.04471e+06,9,1,1061,1.67072e+06,4
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 32649 ms.
BK_STOP 1679482700515
--------------------
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-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-5348"
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 r229-tall-167856413200421"
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 '
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 ;