fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856413200413
Last Updated
May 14, 2023

About the Execution of ITS-Tools for LamportFastMutEx-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
489.296 27670.00 34127.00 2497.40 4 12 4 1 3 4 12 1 1 1 1 1 1 1 0 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-167856413200413.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-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 15K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 334K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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 114K 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679481981879

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-4
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 10:46:23] [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:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:46:23] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-22 10:46:23] [INFO ] Transformed 135 places.
[2023-03-22 10:46:23] [INFO ] Transformed 230 transitions.
[2023-03-22 10:46:23] [INFO ] Found NUPN structural information;
[2023-03-22 10:46:23] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2023-03-22 10:46:23] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 144 out of 180 initially.
// Phase 1: matrix 144 rows 102 cols
[2023-03-22 10:46:23] [INFO ] Computed 26 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :38
FORMULA LamportFastMutEx-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :22
FORMULA LamportFastMutEx-PT-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :23
[2023-03-22 10:46:23] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2023-03-22 10:46:23] [INFO ] Computed 26 place invariants in 12 ms
[2023-03-22 10:46:24] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2023-03-22 10:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:24] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-22 10:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-22 10:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:24] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 10:46:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:46:24] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:46:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 671 ms
[2023-03-22 10:46:24] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:24] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:25] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 382 ms
[2023-03-22 10:46:25] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:46:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:25] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:46:25] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:46:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 319 ms
[2023-03-22 10:46:25] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 11 ms.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2023-03-22 10:46:26] [INFO ] Added : 37 causal constraints over 9 iterations in 349 ms. Result :sat
Minimization took 234 ms.
[2023-03-22 10:46:26] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-22 10:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:26] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:46:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-22 10:46:26] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 10 ms.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-22 10:46:26] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 4 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:46:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 725 ms
[2023-03-22 10:46:27] [INFO ] Added : 56 causal constraints over 14 iterations in 885 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [12, 3, 16, 4] Max seen :[12, 3, 9, 1]
FORMULA LamportFastMutEx-PT-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 176
Applied a total of 8 rules in 24 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 98/102 places, 176/180 transitions.
Normalized transition count is 140 out of 176 initially.
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 10:46:27] [INFO ] Computed 26 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1579 ms. (steps per millisecond=633 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 2) seen :13
[2023-03-22 10:46:30] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 10:46:30] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-22 10:46:30] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-22 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-22 10:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:30] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 10:46:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:46:30] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2023-03-22 10:46:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-22 10:46:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:46:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 452 ms
[2023-03-22 10:46:31] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 10:46:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-22 10:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 10:46:31] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2023-03-22 10:46:31] [INFO ] Computed and/alt/rep : 124/508/124 causal constraints (skipped 12 transitions) in 9 ms.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 10:46:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-22 10:46:31] [INFO ] Added : 50 causal constraints over 11 iterations in 237 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [12, 4] Max seen :[12, 1]
FORMULA LamportFastMutEx-PT-4-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 176/176 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 172
Applied a total of 8 rules in 9 ms. Remains 94 /98 variables (removed 4) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 94/98 places, 172/176 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 10:46:31] [INFO ] Computed 26 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1350 ms. (steps per millisecond=740 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 1) seen :1
[2023-03-22 10:46:33] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 10:46:33] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-22 10:46:33] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:33] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:46:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:46:33] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:46:34] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2023-03-22 10:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-22 10:46:34] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 7 ms.
[2023-03-22 10:46:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 10:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-22 10:46:34] [INFO ] Added : 41 causal constraints over 9 iterations in 146 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:46:34] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:34] [INFO ] Invariant cache hit.
[2023-03-22 10:46:34] [INFO ] Implicit Places using invariants in 92 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 109 ms. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:34] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1313 ms. (steps per millisecond=761 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 508 ms. (steps per millisecond=1968 ) properties (out of 1) seen :1
[2023-03-22 10:46:36] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:36] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-22 10:46:36] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:36] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 10:46:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:36] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:46:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:46:36] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:46:36] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 13 ms.
[2023-03-22 10:46:36] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 0 ms to minimize.
[2023-03-22 10:46:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-22 10:46:36] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 10:46:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 10:46:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 520 ms
[2023-03-22 10:46:37] [INFO ] Added : 70 causal constraints over 14 iterations in 689 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:46:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:37] [INFO ] Invariant cache hit.
[2023-03-22 10:46:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 10:46:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:37] [INFO ] Invariant cache hit.
[2023-03-22 10:46:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:46:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-22 10:46:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 10:46:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:37] [INFO ] Invariant cache hit.
[2023-03-22 10:46:37] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-PT-4-UpperBounds-07
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:37] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-22 10:46:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:37] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 10:46:37] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 10:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:37] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 10:46:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:37] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 10:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:46:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:46:37] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:46:37] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 9 ms.
[2023-03-22 10:46:37] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 10:46:38] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2023-03-22 10:46:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:46:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 10:46:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 227 ms
[2023-03-22 10:46:38] [INFO ] Added : 70 causal constraints over 14 iterations in 394 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:38] [INFO ] Computed 22 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 1) seen :1
[2023-03-22 10:46:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:46:40] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 10:46:40] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 10:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:46:40] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:46:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:46:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:46:40] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:46:40] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 10 ms.
[2023-03-22 10:46:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:46:40] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-22 10:46:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 10:46:40] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2023-03-22 10:46:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 211 ms
[2023-03-22 10:46:40] [INFO ] Added : 70 causal constraints over 14 iterations in 377 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:46:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:40] [INFO ] Invariant cache hit.
[2023-03-22 10:46:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 10:46:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:40] [INFO ] Invariant cache hit.
[2023-03-22 10:46:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:46:40] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-22 10:46:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 10:46:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:46:40] [INFO ] Invariant cache hit.
[2023-03-22 10:46:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-PT-4-UpperBounds-07 in 3481 ms.
[2023-03-22 10:46:41] [INFO ] Flatten gal took : 77 ms
[2023-03-22 10:46:41] [INFO ] Applying decomposition
[2023-03-22 10:46:41] [INFO ] Flatten gal took : 15 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/graph4439400047167522639.txt' '-o' '/tmp/graph4439400047167522639.bin' '-w' '/tmp/graph4439400047167522639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4439400047167522639.bin' '-l' '-1' '-v' '-w' '/tmp/graph4439400047167522639.weights' '-q' '0' '-e' '0.001'
[2023-03-22 10:46:41] [INFO ] Decomposing Gal with order
[2023-03-22 10:46:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 10:46:41] [INFO ] Removed a total of 203 redundant transitions.
[2023-03-22 10:46:41] [INFO ] Flatten gal took : 86 ms
[2023-03-22 10:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 8 ms.
[2023-03-22 10:46:41] [INFO ] Time to serialize gal into /tmp/UpperBounds9746975817234012604.gal : 5 ms
[2023-03-22 10:46:41] [INFO ] Time to serialize properties into /tmp/UpperBounds15893057665470229180.prop : 2 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/UpperBounds9746975817234012604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15893057665470229180.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/UpperBounds15893057665470229180.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,1.4985e+06,1.10082,45060,2,9953,5,158626,6,0,559,173235,0
Total reachable state count : 1498496

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-PT-4-UpperBounds-07 :0 <= gi5.gu15.P_CS_21_1+gi1.gu16.P_CS_21_2+gi2.gu17.P_CS_21_3+gi0.gu18.P_CS_21_4 <= 1
FORMULA LamportFastMutEx-PT-4-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-4-UpperBounds-07,0,1.10823,45060,1,0,7,158626,9,1,785,173235,4
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 19999 ms.

BK_STOP 1679482009549

--------------------
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-4"
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-4, 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-167856413200413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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