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.r234-tall-167856420300442.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 marciexred
Input is LamportFastMutEx-PT-8, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 24K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 228K Feb 25 13:44 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 52K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 321K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 329K 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-8-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-8-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679502090943

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:21:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:21:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:21:32] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-22 16:21:32] [INFO ] Transformed 315 places.
[2023-03-22 16:21:32] [INFO ] Transformed 666 transitions.
[2023-03-22 16:21:32] [INFO ] Found NUPN structural information;
[2023-03-22 16:21:32] [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_start_1_7, P_start_1_8, 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_b_7_false, P_b_7_true, P_b_8_false, P_b_8_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_setx_3_7, P_setx_3_8, 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_setbi_5_7, P_setbi_5_8, 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_ify0_4_7, P_ify0_4_8, 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_sety_9_7, P_sety_9_8, 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_ifxi_10_7, P_ifxi_10_8, 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_setbi_11_7, P_setbi_11_8, 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_fordo_12_7, P_fordo_12_8, 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_0_7, P_wait_0_8, 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_1_7, P_wait_1_8, 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_2_7, P_wait_2_8, 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_3_7, P_wait_3_8, 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_4_7, P_wait_4_8, 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_5_7, P_wait_5_8, 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_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, 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_await_13_7, P_await_13_8, 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_0_7, P_done_0_8, 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_1_7, P_done_1_8, 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_2_7, P_done_2_8, 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_3_7, P_done_3_8, 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_4_7, P_done_4_8, 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_5_7, P_done_5_8, 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_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, 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_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, 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_CS_21_7, P_CS_21_8, 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, P_setbi_24_7, P_setbi_24_8]
[2023-03-22 16:21:32] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 82 transitions.
Support contains 266 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 16:21:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 16:21:32] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-22 16:21:33] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-22 16:21:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:21:33] [INFO ] Invariant cache hit.
[2023-03-22 16:21:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:21:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-22 16:21:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:21:33] [INFO ] Invariant cache hit.
[2023-03-22 16:21:33] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 266 out of 266 places after structural reductions.
[2023-03-22 16:21:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 16:21:34] [INFO ] Flatten gal took : 163 ms
FORMULA LamportFastMutEx-PT-8-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 16:21:34] [INFO ] Flatten gal took : 60 ms
[2023-03-22 16:21:34] [INFO ] Input system was already deterministic with 584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 55) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 16:21:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:21:35] [INFO ] Invariant cache hit.
[2023-03-22 16:21:35] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 16:21:36] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:21:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 16:21:36] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:21:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:21:37] [INFO ] After 434ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:21:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:21:38] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:39] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:40] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:21:41] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-22 16:21:42] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 5 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:43] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:21:44] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-22 16:21:45] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:46] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:21:47] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:21:48] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-03-22 16:21:49] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:21:50] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:51] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:21:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:21:53] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:54] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:21:55] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:56] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:21:57] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:21:58] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:21:59] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2023-03-22 16:22:00] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-22 16:22:01] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 16:22:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:22:01] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 42 ms.
Support contains 112 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 32 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 244833 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244833 steps, saw 135230 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 16:22:04] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:22:04] [INFO ] Invariant cache hit.
[2023-03-22 16:22:04] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 16:22:05] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:22:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 16:22:05] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:22:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:22:06] [INFO ] After 457ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:22:06] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:06] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2023-03-22 16:22:06] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:22:06] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:22:06] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:22:07] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:08] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:22:09] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:22:10] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:11] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:12] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2023-03-22 16:22:13] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2023-03-22 16:22:14] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-22 16:22:15] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:16] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:17] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:18] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:20] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:22:21] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 0 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-22 16:22:22] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:23] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-22 16:22:24] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:25] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-03-22 16:22:27] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:22:28] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2023-03-22 16:22:29] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:22:30] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:22:30] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 16:22:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:22:30] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 39 ms.
Support contains 112 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 20 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 16:22:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:22:30] [INFO ] Invariant cache hit.
[2023-03-22 16:22:30] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-22 16:22:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:22:30] [INFO ] Invariant cache hit.
[2023-03-22 16:22:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:22:30] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-22 16:22:30] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-22 16:22:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 16:22:30] [INFO ] Invariant cache hit.
[2023-03-22 16:22:31] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 266/266 places, 584/584 transitions.
Graph (trivial) has 149 edges and 266 vertex of which 30 / 266 are part of one of the 6 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 72 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 198 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 240 transition count 384
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 238 transition count 380
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 238 transition count 380
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 238 transition count 374
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 21 place count 232 transition count 374
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 232 transition count 374
Applied a total of 29 rules in 72 ms. Remains 232 /266 variables (removed 34) and now considering 374/584 (removed 210) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 374 rows 232 cols
[2023-03-22 16:22:31] [INFO ] Computed 82 place invariants in 4 ms
[2023-03-22 16:22:31] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 16:22:31] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:22:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 16:22:32] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:22:32] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-22 16:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-22 16:22:32] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-22 16:22:33] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 35 ms
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 41 ms
[2023-03-22 16:22:33] [INFO ] Input system was already deterministic with 584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:22:33] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 20 ms
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 21 ms
[2023-03-22 16:22:33] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 19 ms
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 22 ms
[2023-03-22 16:22:33] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 22 ms
[2023-03-22 16:22:33] [INFO ] Flatten gal took : 19 ms
[2023-03-22 16:22:33] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 19 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 22 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 13 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 20 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 20 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 18 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 258/266 places, 576/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 14 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 14 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 259 transition count 577
Applied a total of 14 rules in 14 ms. Remains 259 /266 variables (removed 7) and now considering 577/584 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 259/266 places, 577/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 577 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 584/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 14 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 16 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 259 transition count 577
Applied a total of 14 rules in 14 ms. Remains 259 /266 variables (removed 7) and now considering 577/584 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 259/266 places, 577/584 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 13 ms
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 16:22:34] [INFO ] Input system was already deterministic with 577 transitions.
[2023-03-22 16:22:34] [INFO ] Flatten gal took : 32 ms
[2023-03-22 16:22:35] [INFO ] Flatten gal took : 31 ms
[2023-03-22 16:22:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 39 ms.
[2023-03-22 16:22:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 584 transitions and 2560 arcs took 3 ms.
Total runtime 62973 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 266 NrTr: 584 NrArc: 2560)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.017sec

net check time: 0m 0.000sec

init dd package: 0m 2.683sec


before gc: list nodes free: 1269709

after gc: idd nodes used:1427568, unused:62572432; list nodes free:270549744
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6369360 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16092692 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

13537 54030 57374 96739 97842 95082 247180 284939 268989 246734 277209 292746 498988 534132 548560 529981 572449 549476 580725 577763 641555 605846 1009191 1298645 1407704 1429223 1394598

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-8"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is LamportFastMutEx-PT-8, 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 r234-tall-167856420300442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;