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.r528-tall-171683761800746.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 ShieldRVs-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761800746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:43 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 ShieldRVs-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717262739244

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:25:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:25:40] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 17:25:40] [INFO ] Transformed 123 places.
[2024-06-01 17:25:40] [INFO ] Transformed 138 transitions.
[2024-06-01 17:25:40] [INFO ] Found NUPN structural information;
[2024-06-01 17:25:40] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 91 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 137
Applied a total of 2 rules in 23 ms. Remains 122 /123 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 122 cols
[2024-06-01 17:25:40] [INFO ] Computed 13 invariants in 15 ms
[2024-06-01 17:25:40] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 17:25:40] [INFO ] Invariant cache hit.
[2024-06-01 17:25:41] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-06-01 17:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 11 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 34 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 3 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:42] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 5 ms to minimize.
[2024-06-01 17:25:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:49] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 14/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:51] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 18/185 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 2 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:25:52] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 18/203 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:53] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:54] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:25:54] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:54] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:25:54] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:54] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:25:55] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:25:56] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:57] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:25:57] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:25:57] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:25:57] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:25:57] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 17/245 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:25:58] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/122 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 19 (OVERLAPS) 137/259 variables, 122/375 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:26:00] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:26:01] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:26:01] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/259 variables, 13/388 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:01] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:26:01] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2024-06-01 17:26:02] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/259 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:26:03] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/259 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/259 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:26:05] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/259 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:06] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:26:06] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:26:06] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:26:06] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:26:07] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:26:07] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:26:07] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:26:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/259 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:07] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/259 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:26:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:26:09] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/259 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:26:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/259 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 259/259 variables, and 426 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 291/291 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 291/304 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:11] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-06-01 17:26:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:26:11] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:26:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:26:12] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:26:12] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:26:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/259 variables, 122/434 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 136/570 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:26:15] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:26:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:26:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:26:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:20] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:26:20] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:26:27] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:26:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:26:32] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 17:26:37] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:26:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 584 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 313/313 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 137/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 122/123 places, 137/138 transitions.
Support contains 91 out of 122 places after structural reductions.
[2024-06-01 17:26:41] [INFO ] Flatten gal took : 34 ms
[2024-06-01 17:26:41] [INFO ] Flatten gal took : 14 ms
[2024-06-01 17:26:41] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (266 resets) in 1976 ms. (20 steps per ms) remains 7/83 properties
BEST_FIRST walk for 40003 steps (53 resets) in 238 ms. (167 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (55 resets) in 350 ms. (113 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (41 resets) in 288 ms. (138 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
[2024-06-01 17:26:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/122 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/259 variables, 122/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 17:26:42] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 17:26:42] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 4 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Int declared 122/259 variables, and 13 constraints, problems are : Problem set: 5 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/2 constraints]
After SMT, in 291ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-003B-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:26:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 11 ms
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:26:42] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 76 out of 122 places (down from 79) after GAL structural reductions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 103 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 7 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 103/122 places, 118/137 transitions.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:26:42] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 103 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 7 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 103/122 places, 118/137 transitions.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:42] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 123
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 107 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 107 transition count 122
Applied a total of 30 rules in 9 ms. Remains 107 /122 variables (removed 15) and now considering 122/137 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 107/122 places, 122/137 transitions.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:26:42] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 104 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 103 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 9 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 103/122 places, 118/137 transitions.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:26:42] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 122
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 106 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 106 transition count 121
Applied a total of 32 rules in 9 ms. Remains 106 /122 variables (removed 16) and now considering 121/137 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 106/122 places, 121/137 transitions.
[2024-06-01 17:26:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 121 transition count 123
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 108 transition count 123
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 108 transition count 109
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 73 place count 75 transition count 90
Iterating global reduction 2 with 19 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 92 place count 75 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 66 transition count 81
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 150 place count 46 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 44 transition count 59
Applied a total of 152 rules in 31 ms. Remains 44 /122 variables (removed 78) and now considering 59/137 (removed 78) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 44/122 places, 59/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 105 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 105 transition count 120
Applied a total of 34 rules in 4 ms. Remains 105 /122 variables (removed 17) and now considering 120/137 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/122 places, 120/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 105 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 105 transition count 120
Applied a total of 34 rules in 3 ms. Remains 105 /122 variables (removed 17) and now considering 120/137 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 105/122 places, 120/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 121 transition count 124
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 109 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 108 transition count 123
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 26 place count 108 transition count 110
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 52 place count 95 transition count 110
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 68 place count 79 transition count 94
Iterating global reduction 3 with 16 rules applied. Total rules applied 84 place count 79 transition count 94
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 84 place count 79 transition count 86
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 71 transition count 86
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 140 place count 51 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 49 transition count 64
Applied a total of 142 rules in 19 ms. Remains 49 /122 variables (removed 73) and now considering 64/137 (removed 73) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 49/122 places, 64/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 121 transition count 125
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 110 transition count 125
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 110 transition count 109
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 73 place count 75 transition count 90
Iterating global reduction 2 with 19 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 92 place count 75 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 66 transition count 81
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 142 place count 50 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 63
Applied a total of 144 rules in 16 ms. Remains 48 /122 variables (removed 74) and now considering 63/137 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 48/122 places, 63/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 104 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 103 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 4 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/122 places, 118/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 121 transition count 125
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 110 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 109 transition count 124
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 24 place count 109 transition count 108
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 56 place count 93 transition count 108
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 74 place count 75 transition count 90
Iterating global reduction 3 with 18 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 75 transition count 82
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 67 transition count 82
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 148 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 46 transition count 61
Applied a total of 149 rules in 26 ms. Remains 46 /122 variables (removed 76) and now considering 61/137 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 46/122 places, 61/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 127
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 112 transition count 127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 20 place count 112 transition count 110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 54 place count 95 transition count 110
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 68 place count 81 transition count 96
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 81 transition count 96
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 82 place count 81 transition count 91
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 76 transition count 91
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 124 place count 60 transition count 75
Applied a total of 124 rules in 16 ms. Remains 60 /122 variables (removed 62) and now considering 75/137 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 60/122 places, 75/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 122 transition count 128
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 113 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 112 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 20 place count 112 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 98 transition count 113
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 65 place count 81 transition count 96
Iterating global reduction 3 with 17 rules applied. Total rules applied 82 place count 81 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 82 place count 81 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 77 transition count 92
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 124 place count 60 transition count 75
Applied a total of 124 rules in 17 ms. Remains 60 /122 variables (removed 62) and now considering 75/137 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 60/122 places, 75/137 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:26:43] [INFO ] Input system was already deterministic with 75 transitions.
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:26:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:26:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 17:26:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 137 transitions and 430 arcs took 1 ms.
Total runtime 62938 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 : ShieldRVs-PT-003B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-003B-CTLFireability-2023-15

BK_STOP 1717262803753

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1471/ctl_0_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1471/ctl_1_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1471/ctl_2_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1471/ctl_3_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1471/ctl_4_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1471/ctl_5_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1471/ctl_6_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1471/ctl_7_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1471/ctl_8_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1471/ctl_9_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1471/ctl_10_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1471/ctl_11_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1471/ctl_12_
ctl formula name ShieldRVs-PT-003B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1471/ctl_13_
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="ShieldRVs-PT-003B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-003B, 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 r528-tall-171683761800746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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