About the Execution of LTSMin+red for LamportFastMutEx-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2928.880 | 3599842.00 | 14316312.00 | 573.20 | ????????????T??? | 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.r233-tall-167856418900426.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 ltsminxred
Input is LamportFastMutEx-PT-6, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418900426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 16K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 175K 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 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 68K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 349K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 208K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-6-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679518159549
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-6
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 20:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:49:21] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-22 20:49:21] [INFO ] Transformed 217 places.
[2023-03-22 20:49:21] [INFO ] Transformed 420 transitions.
[2023-03-22 20:49:21] [INFO ] Found NUPN structural information;
[2023-03-22 20:49:21] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2023-03-22 20:49:21] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Support contains 176 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 20:49:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 20:49:21] [INFO ] Computed 50 place invariants in 21 ms
[2023-03-22 20:49:21] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-22 20:49:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 20:49:21] [INFO ] Invariant cache hit.
[2023-03-22 20:49:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 20:49:21] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-22 20:49:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 20:49:21] [INFO ] Invariant cache hit.
[2023-03-22 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 176/176 places, 354/354 transitions.
Support contains 176 out of 176 places after structural reductions.
[2023-03-22 20:49:22] [INFO ] Flatten gal took : 64 ms
[2023-03-22 20:49:22] [INFO ] Flatten gal took : 57 ms
[2023-03-22 20:49:22] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 75) seen :64
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 20:49:23] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 20:49:23] [INFO ] Invariant cache hit.
[2023-03-22 20:49:24] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 20:49:24] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:5
[2023-03-22 20:49:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 20:49:24] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-22 20:49:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 20:49:24] [INFO ] After 128ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 3 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-22 20:49:25] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 20:49:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:27] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 4 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:28] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 4392 ms
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 9 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-22 20:49:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 327 ms
[2023-03-22 20:49:29] [INFO ] After 4978ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-22 20:49:29] [INFO ] After 5559ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 27 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 30 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 170/176 places, 348/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 20:49:30] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 20:49:30] [INFO ] Computed 50 place invariants in 6 ms
[2023-03-22 20:49:30] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 20:49:30] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:49:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 20:49:30] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:49:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 20:49:30] [INFO ] After 82ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:49:30] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:30] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:30] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:30] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:31] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:49:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:35] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:36] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2023-03-22 20:49:37] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:38] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:39] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:40] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:49:41] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-22 20:49:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-22 20:49:43] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:49:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:49:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:49:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:49:45] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:49:45] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-22 20:49:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 187 trap constraints in 14631 ms
[2023-03-22 20:49:45] [INFO ] After 14807ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-22 20:49:45] [INFO ] After 14991ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 28 ms
[2023-03-22 20:49:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-6-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 33 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 18 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 15 ms
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 16 ms
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 13 ms
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 15 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 13 ms
[2023-03-22 20:49:45] [INFO ] Flatten gal took : 14 ms
[2023-03-22 20:49:45] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 15 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 354/354 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 171 transition count 349
Applied a total of 10 rules in 21 ms. Remains 171 /176 variables (removed 5) and now considering 349/354 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 171/176 places, 349/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 9 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 354/354 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 171 transition count 349
Applied a total of 10 rules in 14 ms. Remains 171 /176 variables (removed 5) and now considering 349/354 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 171/176 places, 349/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 9 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 176/176 places, 354/354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:49:46] [INFO ] Input system was already deterministic with 354 transitions.
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 19 ms
[2023-03-22 20:49:46] [INFO ] Flatten gal took : 21 ms
[2023-03-22 20:49:46] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 20 ms.
[2023-03-22 20:49:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 354 transitions and 1536 arcs took 3 ms.
Total runtime 25526 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1216/ctl_0_ --ctl=/tmp/1216/ctl_1_ --ctl=/tmp/1216/ctl_2_ --ctl=/tmp/1216/ctl_3_ --ctl=/tmp/1216/ctl_4_ --ctl=/tmp/1216/ctl_5_ --ctl=/tmp/1216/ctl_6_ --ctl=/tmp/1216/ctl_7_ --ctl=/tmp/1216/ctl_8_ --ctl=/tmp/1216/ctl_9_ --ctl=/tmp/1216/ctl_10_ --ctl=/tmp/1216/ctl_11_ --ctl=/tmp/1216/ctl_12_ --ctl=/tmp/1216/ctl_13_ --ctl=/tmp/1216/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 13213840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093160 kB
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-00
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-01
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-02
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-03
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-04
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-05
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-06
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-07
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-08
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-09
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-10
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-11
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-13
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-14
Could not compute solution for formula : LamportFastMutEx-PT-6-CTLFireability-15
BK_STOP 1679521759391
--------------------
content from stderr:
+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name LamportFastMutEx-PT-6-CTLFireability-00
ctl formula formula --ctl=/tmp/1216/ctl_0_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-01
ctl formula formula --ctl=/tmp/1216/ctl_1_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-02
ctl formula formula --ctl=/tmp/1216/ctl_2_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-03
ctl formula formula --ctl=/tmp/1216/ctl_3_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-04
ctl formula formula --ctl=/tmp/1216/ctl_4_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-05
ctl formula formula --ctl=/tmp/1216/ctl_5_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-06
ctl formula formula --ctl=/tmp/1216/ctl_6_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-07
ctl formula formula --ctl=/tmp/1216/ctl_7_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-08
ctl formula formula --ctl=/tmp/1216/ctl_8_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-09
ctl formula formula --ctl=/tmp/1216/ctl_9_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-10
ctl formula formula --ctl=/tmp/1216/ctl_10_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-11
ctl formula formula --ctl=/tmp/1216/ctl_11_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-13
ctl formula formula --ctl=/tmp/1216/ctl_12_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-14
ctl formula formula --ctl=/tmp/1216/ctl_13_
ctl formula name LamportFastMutEx-PT-6-CTLFireability-15
ctl formula formula --ctl=/tmp/1216/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 176 places, 354 transitions and 1536 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 354->312 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 176; there are 312 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 1222
Killing (9) : 1222
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-6"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LamportFastMutEx-PT-6, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418900426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-6.tgz
mv LamportFastMutEx-PT-6 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;