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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 66K 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 ShieldIIPs-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-004B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717223668158

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:34:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:34:29] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 06:34:29] [INFO ] Transformed 243 places.
[2024-06-01 06:34:29] [INFO ] Transformed 239 transitions.
[2024-06-01 06:34:29] [INFO ] Found NUPN structural information;
[2024-06-01 06:34:29] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 109 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 232 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 232 transition count 228
Applied a total of 22 rules in 34 ms. Remains 232 /243 variables (removed 11) and now considering 228/239 (removed 11) transitions.
// Phase 1: matrix 228 rows 232 cols
[2024-06-01 06:34:29] [INFO ] Computed 37 invariants in 13 ms
[2024-06-01 06:34:29] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 06:34:29] [INFO ] Invariant cache hit.
[2024-06-01 06:34:29] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-06-01 06:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 12 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:32] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:36] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:34:39] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:34:52] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 12/201 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 18 (OVERLAPS) 228/460 variables, 232/437 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 439 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 170/170 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 170/207 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:01] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 2 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 228/460 variables, 232/510 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 227/737 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 20/757 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 769 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 273/273 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 228/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 232/243 places, 228/239 transitions.
Support contains 109 out of 232 places after structural reductions.
[2024-06-01 06:35:30] [INFO ] Flatten gal took : 40 ms
[2024-06-01 06:35:30] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:35:30] [INFO ] Input system was already deterministic with 228 transitions.
RANDOM walk for 40000 steps (67 resets) in 1642 ms. (24 steps per ms) remains 7/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 87 ms. (454 steps per ms) remains 4/5 properties
[2024-06-01 06:35:31] [INFO ] Invariant cache hit.
Problem AtomicPropp31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (OVERLAPS) 218/232 variables, 37/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 6/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/460 variables, 232/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 6/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 281 constraints, problems are : Problem set: 3 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/86 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/232 variables, 25/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 12/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 228/460 variables, 232/284 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/285 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/460 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 285 constraints, problems are : Problem set: 3 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 969ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 228/228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 232 transition count 208
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 212 transition count 208
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 40 place count 212 transition count 188
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 192 transition count 188
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 97 place count 175 transition count 171
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 175 transition count 171
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 114 place count 175 transition count 162
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 132 place count 166 transition count 162
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 254 place count 105 transition count 101
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 279 place count 105 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 104 transition count 100
Applied a total of 280 rules in 53 ms. Remains 104 /232 variables (removed 128) and now considering 100/228 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 104/232 places, 100/228 transitions.
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 112 steps, run visited all 1 properties in 5 ms. (steps per millisecond=22 )
Probabilistic random walk after 112 steps, saw 93 distinct states, run finished after 10 ms. (steps per millisecond=11 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 228 transitions.
Support contains 100 out of 232 places (down from 102) after GAL structural reductions.
Computed a total of 60 stabilizing places and 60 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 218 transition count 214
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 218 transition count 214
Applied a total of 28 rules in 7 ms. Remains 218 /232 variables (removed 14) and now considering 214/228 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 218/232 places, 214/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 217 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 217 transition count 213
Applied a total of 30 rules in 7 ms. Remains 217 /232 variables (removed 15) and now considering 213/228 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 217/232 places, 213/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 215 transition count 211
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 215 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 210
Applied a total of 36 rules in 10 ms. Remains 214 /232 variables (removed 18) and now considering 210/228 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 214/232 places, 210/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 216 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 216 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 211
Applied a total of 34 rules in 9 ms. Remains 215 /232 variables (removed 17) and now considering 211/228 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 215/232 places, 211/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 231 transition count 207
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 211 transition count 207
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 211 transition count 186
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 190 transition count 186
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 99 place count 173 transition count 169
Iterating global reduction 2 with 17 rules applied. Total rules applied 116 place count 173 transition count 169
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 116 place count 173 transition count 159
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 136 place count 163 transition count 159
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 256 place count 103 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 258 place count 101 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 259 place count 100 transition count 97
Applied a total of 259 rules in 28 ms. Remains 100 /232 variables (removed 132) and now considering 97/228 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 100/232 places, 97/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 97 transitions.
RANDOM walk for 571 steps (0 resets) in 8 ms. (63 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-004B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 231 transition count 206
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 210 transition count 206
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 42 place count 210 transition count 186
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 82 place count 190 transition count 186
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 99 place count 173 transition count 169
Iterating global reduction 2 with 17 rules applied. Total rules applied 116 place count 173 transition count 169
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 116 place count 173 transition count 159
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 136 place count 163 transition count 159
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 254 place count 104 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 102 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 101 transition count 98
Applied a total of 257 rules in 25 ms. Remains 101 /232 variables (removed 131) and now considering 98/228 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 101/232 places, 98/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 113 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-004B-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 231 transition count 206
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 210 transition count 206
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 42 place count 210 transition count 186
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 82 place count 190 transition count 186
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 98 place count 174 transition count 170
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 174 transition count 170
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 114 place count 174 transition count 161
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 132 place count 165 transition count 161
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 242 place count 110 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 108 transition count 104
Applied a total of 244 rules in 27 ms. Remains 108 /232 variables (removed 124) and now considering 104/228 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 108/232 places, 104/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 218
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 217
Applied a total of 22 rules in 8 ms. Remains 221 /232 variables (removed 11) and now considering 217/228 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 221/232 places, 217/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 216 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 216 transition count 212
Applied a total of 32 rules in 6 ms. Remains 216 /232 variables (removed 16) and now considering 212/228 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 216/232 places, 212/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 216 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 216 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 211
Applied a total of 34 rules in 10 ms. Remains 215 /232 variables (removed 17) and now considering 211/228 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 215/232 places, 211/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 215 transition count 211
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 215 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 210
Applied a total of 36 rules in 10 ms. Remains 214 /232 variables (removed 18) and now considering 210/228 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 214/232 places, 210/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:32] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 231 transition count 208
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 212 transition count 208
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 212 transition count 188
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 192 transition count 188
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 95 place count 175 transition count 171
Iterating global reduction 2 with 17 rules applied. Total rules applied 112 place count 175 transition count 171
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 112 place count 175 transition count 162
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 130 place count 166 transition count 162
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 234 place count 114 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 112 transition count 108
Applied a total of 236 rules in 28 ms. Remains 112 /232 variables (removed 120) and now considering 108/228 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 112/232 places, 108/228 transitions.
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:32] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:35:33] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 231 transition count 207
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 211 transition count 207
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 211 transition count 186
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 190 transition count 186
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 99 place count 173 transition count 169
Iterating global reduction 2 with 17 rules applied. Total rules applied 116 place count 173 transition count 169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 116 place count 173 transition count 160
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 134 place count 164 transition count 160
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 254 place count 104 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 102 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 101 transition count 98
Applied a total of 257 rules in 21 ms. Remains 101 /232 variables (removed 131) and now considering 98/228 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 101/232 places, 98/228 transitions.
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:35:33] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 216 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 216 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 211
Applied a total of 34 rules in 9 ms. Remains 215 /232 variables (removed 17) and now considering 211/228 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 215/232 places, 211/228 transitions.
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:33] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 217 transition count 213
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 217 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 216 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 216 transition count 212
Applied a total of 32 rules in 7 ms. Remains 216 /232 variables (removed 16) and now considering 212/228 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 216/232 places, 212/228 transitions.
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:35:33] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 228/228 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 219 transition count 215
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 219 transition count 215
Applied a total of 26 rules in 5 ms. Remains 219 /232 variables (removed 13) and now considering 215/228 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 219/232 places, 215/228 transitions.
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:33] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:35:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 06:35:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 228 transitions and 696 arcs took 2 ms.
Total runtime 64008 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 : ShieldIIPs-PT-004B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-004B-CTLFireability-2023-15

BK_STOP 1717223733560

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1386/ctl_0_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1386/ctl_1_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1386/ctl_2_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1386/ctl_3_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1386/ctl_4_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1386/ctl_5_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1386/ctl_6_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1386/ctl_7_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1386/ctl_8_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1386/ctl_9_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1386/ctl_10_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1386/ctl_11_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1386/ctl_12_
ctl formula name ShieldIIPs-PT-004B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1386/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="ShieldIIPs-PT-004B"
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 ShieldIIPs-PT-004B, 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-171683760300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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