Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505100097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 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 CANInsertWithFailure-PT-010-CTLCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2023-12
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717186084117

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:08:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:08:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:08:05] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-31 20:08:05] [INFO ] Transformed 324 places.
[2024-05-31 20:08:05] [INFO ] Transformed 660 transitions.
[2024-05-31 20:08:05] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 120 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Applied a total of 0 rules in 24 ms. Remains 324 /324 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 324 cols
[2024-05-31 20:08:05] [INFO ] Computed 13 invariants in 29 ms
[2024-05-31 20:08:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 20:08:05] [INFO ] Invariant cache hit.
[2024-05-31 20:08:06] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-31 20:08:06] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-31 20:08:06] [INFO ] Invariant cache hit.
[2024-05-31 20:08:06] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:10] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 10 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:11] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 7 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:22] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:08:22] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:08:23] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:08:23] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:23] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:24] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:27] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:27] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:27] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:08:27] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Finished structural reductions in LTL mode , in 1 iterations and 30991 ms. Remains : 324/324 places, 660/660 transitions.
Support contains 120 out of 324 places after structural reductions.
[2024-05-31 20:08:36] [INFO ] Flatten gal took : 62 ms
[2024-05-31 20:08:36] [INFO ] Flatten gal took : 31 ms
[2024-05-31 20:08:36] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 114 out of 324 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (176 resets) in 1665 ms. (24 steps per ms) remains 16/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-05-31 20:08:37] [INFO ] Invariant cache hit.
[2024-05-31 20:08:37] [INFO ] State equation strengthened by 190 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 286/311 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 10/321 variables, 5/10 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/322 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 660/982 variables, 322/334 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 190/524 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/524 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2/984 variables, 2/526 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 1/527 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/984 variables, 0/527 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/984 variables, 0/527 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 527 constraints, problems are : Problem set: 4 solved, 12 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 283/304 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-31 20:08:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:08:38] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 9/11 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 16/320 variables, 8/19 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/322 variables, 2/21 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:08:39] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:40] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:40] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:08:40] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 10/31 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 660/982 variables, 322/353 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 190/543 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 10/553 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/982 variables, 0/553 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 2/984 variables, 2/555 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/984 variables, 1/556 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/984 variables, 2/558 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 0/558 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/984 variables, 0/558 constraints. Problems are: Problem set: 5 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 984/984 variables, and 558 constraints, problems are : Problem set: 5 solved, 11 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 12/16 constraints, Known Traps: 19/19 constraints]
After SMT, in 5576ms problems are : Problem set: 5 solved, 11 unsolved
Parikh walk visited 0 properties in 3246 ms.
Support contains 20 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 323 transition count 604
Reduce places removed 56 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 67 rules applied. Total rules applied 124 place count 267 transition count 593
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 135 place count 256 transition count 593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 135 place count 256 transition count 592
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 255 transition count 592
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 269 place count 189 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 319 place count 189 transition count 476
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 189 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 188 transition count 475
Partial Free-agglomeration rule applied 123 times.
Drop transitions (Partial Free agglomeration) removed 123 transitions
Iterating global reduction 4 with 123 rules applied. Total rules applied 444 place count 188 transition count 475
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 456 place count 188 transition count 475
Applied a total of 456 rules in 134 ms. Remains 188 /324 variables (removed 136) and now considering 475/660 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 188/324 places, 475/660 transitions.
RANDOM walk for 40000 steps (644 resets) in 490 ms. (81 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (65 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (65 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 621692 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 10
Probabilistic random walk after 621692 steps, saw 83671 distinct states, run finished after 3005 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 475 rows 188 cols
[2024-05-31 20:08:50] [INFO ] Computed 12 invariants in 4 ms
[2024-05-31 20:08:50] [INFO ] State equation strengthened by 371 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 152/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/187 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 475/662 variables, 187/199 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 371/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/663 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/663 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 571 constraints, problems are : Problem set: 0 solved, 10 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 371/371 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 152/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 16/185 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/187 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 475/662 variables, 187/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 371/581 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 10/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/663 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/663 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/663 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 592 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 371/371 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 11/11 constraints]
After SMT, in 2468ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 282 ms.
Support contains 17 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 475/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 474
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 187 transition count 474
Applied a total of 5 rules in 27 ms. Remains 187 /188 variables (removed 1) and now considering 474/475 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 187/188 places, 474/475 transitions.
RANDOM walk for 40000 steps (656 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (66 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 754234 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 10
Probabilistic random walk after 754234 steps, saw 97887 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 474 rows 187 cols
[2024-05-31 20:08:56] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 20:08:56] [INFO ] State equation strengthened by 375 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/184 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/186 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 474/660 variables, 186/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 375/573 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/661 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/661 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 574 constraints, problems are : Problem set: 0 solved, 10 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 187/187 constraints, ReadFeed: 375/375 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 16/184 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/186 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:08:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 474/660 variables, 186/224 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 375/599 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 10/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/661 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/661 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/661 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 610 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 187/187 constraints, ReadFeed: 375/375 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 26/26 constraints]
After SMT, in 3603ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 304 ms.
Support contains 17 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 474/474 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 187/187 places, 474/474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 474/474 transitions.
Applied a total of 0 rules in 10 ms. Remains 187 /187 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-31 20:09:00] [INFO ] Invariant cache hit.
[2024-05-31 20:09:00] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 20:09:00] [INFO ] Invariant cache hit.
[2024-05-31 20:09:00] [INFO ] State equation strengthened by 375 read => feed constraints.
[2024-05-31 20:09:00] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-31 20:09:00] [INFO ] Redundant transitions in 24 ms returned []
Running 464 sub problems to find dead transitions.
[2024-05-31 20:09:00] [INFO ] Invariant cache hit.
[2024-05-31 20:09:00] [INFO ] State equation strengthened by 375 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:09:04] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:09:05] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:09:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:09:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:09:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:09:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:09:07] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:09:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2024-05-31 20:09:09] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:09:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:09:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:09:13] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:09:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:09:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:09:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 464 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30808 ms. Remains : 187/187 places, 474/474 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 304 edges and 187 vertex of which 95 / 187 are part of one of the 2 SCC in 3 ms
Free SCC test removed 93 places
Drop transitions (Empty/Sink Transition effects.) removed 202 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 276 transitions.
Graph (complete) has 272 edges and 94 vertex of which 64 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 64 transition count 155
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 55 place count 45 transition count 118
Iterating global reduction 1 with 19 rules applied. Total rules applied 74 place count 45 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 80 place count 45 transition count 112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 39 transition count 100
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 39 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 39 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 38 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 37 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 113 place count 37 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 37 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 36 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 115 place count 36 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 35 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 119 place count 34 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 121 place count 34 transition count 80
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 34 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 33 transition count 79
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 33 transition count 79
Applied a total of 124 rules in 37 ms. Remains 33 /187 variables (removed 154) and now considering 79/474 (removed 395) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 79 rows 33 cols
[2024-05-31 20:09:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 20:09:31] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 20:09:31] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-31 20:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:09:31] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-31 20:09:31] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-31 20:09:31] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 293 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 25 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Computed a total of 43 stabilizing places and 70 stable transitions
Graph (complete) has 1152 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:31] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:09:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 324/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 3 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 3 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 1152 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 161 place count 243 transition count 580
Partial Post-agglomeration rule applied 34 times.
Drop transitions (Partial Post agglomeration) removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 195 place count 243 transition count 580
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 211 place count 227 transition count 564
Iterating global reduction 3 with 16 rules applied. Total rules applied 227 place count 227 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 235 place count 227 transition count 556
Applied a total of 235 rules in 48 ms. Remains 227 /324 variables (removed 97) and now considering 556/660 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 227/324 places, 556/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 3 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 5 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/324 places, 660/660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:09:32] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:09:32] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:09:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 324 places, 660 transitions and 1800 arcs took 4 ms.
Total runtime 87351 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLCardinality-2023-15

BK_STOP 1717186173064

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1424/ctl_0_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1424/ctl_1_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1424/ctl_2_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1424/ctl_3_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1424/ctl_4_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1424/ctl_5_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1424/ctl_6_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1424/ctl_7_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1424/ctl_8_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1424/ctl_9_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1424/ctl_10_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1424/ctl_11_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1424/ctl_12_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1424/ctl_13_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1424/ctl_14_
ctl formula name CANInsertWithFailure-PT-010-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1424/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505100097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;