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.r355-tall-171683758700425.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 greatspnxred
Input is ShieldPPPs-PT-005B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 86K 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 ShieldPPPs-PT-005B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPs-PT-005B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716961778951

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 05:49:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 05:49:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:49:40] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-29 05:49:40] [INFO ] Transformed 343 places.
[2024-05-29 05:49:40] [INFO ] Transformed 318 transitions.
[2024-05-29 05:49:40] [INFO ] Found NUPN structural information;
[2024-05-29 05:49:40] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-005B-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 324 transition count 299
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 324 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 323 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 323 transition count 298
Applied a total of 40 rules in 68 ms. Remains 323 /343 variables (removed 20) and now considering 298/318 (removed 20) transitions.
// Phase 1: matrix 298 rows 323 cols
[2024-05-29 05:49:40] [INFO ] Computed 56 invariants in 18 ms
[2024-05-29 05:49:40] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-29 05:49:40] [INFO ] Invariant cache hit.
[2024-05-29 05:49:40] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-29 05:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 13 ms to minimize.
[2024-05-29 05:49:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-29 05:49:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
[2024-05-29 05:49:46] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:46] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-29 05:49:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:49:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-29 05:49:47] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:49:48] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:49:50] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:49:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:51] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:51] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:49:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:51] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 3 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:49:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:49:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:49:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:49:54] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-29 05:49:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:49:59] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:49:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:49:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:49:59] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 14/190 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:07] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-29 05:50:07] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:07] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:07] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:07] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:08] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:50:08] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 2 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/621 variables, and 239 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 183/183 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:50:17] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:18] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:18] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 2 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 3 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:21] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:21] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:21] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:22] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:23] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:23] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 17/325 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 15/340 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 15/355 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 7/362 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 05:50:40] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:40] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:40] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:40] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:40] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:41] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/621 variables, and 395 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/323 constraints, PredecessorRefiner: 0/297 constraints, Known Traps: 339/339 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 323/343 places, 298/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60745 ms. Remains : 323/343 places, 298/318 transitions.
Support contains 97 out of 323 places after structural reductions.
[2024-05-29 05:50:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 47 ms
FORMULA ShieldPPPs-PT-005B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 19 ms
[2024-05-29 05:50:41] [INFO ] Input system was already deterministic with 298 transitions.
Support contains 83 out of 323 places (down from 97) after GAL structural reductions.
RANDOM walk for 14529 steps (14 resets) in 382 ms. (37 steps per ms) remains 0/53 properties
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:50:41] [INFO ] Input system was already deterministic with 298 transitions.
Computed a total of 70 stabilizing places and 70 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 322 transition count 263
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 288 transition count 263
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 68 place count 288 transition count 239
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 116 place count 264 transition count 239
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 249 transition count 224
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 249 transition count 224
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 146 place count 249 transition count 216
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 162 place count 241 transition count 216
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 318 place count 163 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 161 transition count 136
Applied a total of 320 rules in 55 ms. Remains 161 /323 variables (removed 162) and now considering 136/298 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 161/323 places, 136/298 transitions.
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:50:41] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 322 transition count 262
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 287 transition count 262
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 70 place count 287 transition count 237
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 120 place count 262 transition count 237
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 247 transition count 222
Iterating global reduction 2 with 15 rules applied. Total rules applied 150 place count 247 transition count 222
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 150 place count 247 transition count 215
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 164 place count 240 transition count 215
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 322 place count 161 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 159 transition count 134
Applied a total of 324 rules in 42 ms. Remains 159 /323 variables (removed 164) and now considering 134/298 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 159/323 places, 134/298 transitions.
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:41] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:50:41] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 322 transition count 261
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 286 transition count 261
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 286 transition count 237
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 262 transition count 237
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 248 transition count 223
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 248 transition count 223
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 148 place count 248 transition count 216
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 162 place count 241 transition count 216
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 322 place count 161 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 159 transition count 134
Applied a total of 324 rules in 53 ms. Remains 159 /323 variables (removed 164) and now considering 134/298 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 159/323 places, 134/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 307 transition count 282
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 307 transition count 282
Applied a total of 32 rules in 12 ms. Remains 307 /323 variables (removed 16) and now considering 282/298 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 307/323 places, 282/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 307 transition count 282
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 307 transition count 282
Applied a total of 32 rules in 11 ms. Remains 307 /323 variables (removed 16) and now considering 282/298 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 307/323 places, 282/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 307 transition count 282
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 307 transition count 282
Applied a total of 32 rules in 10 ms. Remains 307 /323 variables (removed 16) and now considering 282/298 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 307/323 places, 282/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 310 transition count 285
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 310 transition count 285
Applied a total of 26 rules in 15 ms. Remains 310 /323 variables (removed 13) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 310/323 places, 285/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 310 transition count 285
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 310 transition count 285
Applied a total of 26 rules in 10 ms. Remains 310 /323 variables (removed 13) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 310/323 places, 285/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 310 transition count 285
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 310 transition count 285
Applied a total of 26 rules in 6 ms. Remains 310 /323 variables (removed 13) and now considering 285/298 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 310/323 places, 285/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 322 transition count 261
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 286 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 285 transition count 260
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 285 transition count 235
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 260 transition count 235
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 140 place count 244 transition count 219
Iterating global reduction 3 with 16 rules applied. Total rules applied 156 place count 244 transition count 219
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 156 place count 244 transition count 211
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 172 place count 236 transition count 211
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 324 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 158 transition count 133
Applied a total of 326 rules in 28 ms. Remains 158 /323 variables (removed 165) and now considering 133/298 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 158/323 places, 133/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 322 transition count 260
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 285 transition count 260
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 285 transition count 235
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 260 transition count 235
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 139 place count 245 transition count 220
Iterating global reduction 2 with 15 rules applied. Total rules applied 154 place count 245 transition count 220
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 154 place count 245 transition count 213
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 168 place count 238 transition count 213
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 328 place count 158 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 330 place count 156 transition count 131
Applied a total of 330 rules in 26 ms. Remains 156 /323 variables (removed 167) and now considering 131/298 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 156/323 places, 131/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 131 transitions.
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
FORMULA ShieldPPPs-PT-005B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 322 transition count 260
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 285 transition count 260
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 285 transition count 235
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 260 transition count 235
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 244 transition count 219
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 244 transition count 219
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 156 place count 244 transition count 211
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 172 place count 236 transition count 211
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 326 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 328 place count 157 transition count 132
Applied a total of 328 rules in 24 ms. Remains 157 /323 variables (removed 166) and now considering 132/298 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 157/323 places, 132/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 322 transition count 262
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 287 transition count 260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 285 transition count 260
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 285 transition count 235
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 260 transition count 235
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 140 place count 244 transition count 219
Iterating global reduction 3 with 16 rules applied. Total rules applied 156 place count 244 transition count 219
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 156 place count 244 transition count 211
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 172 place count 236 transition count 211
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 330 place count 157 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 155 transition count 130
Applied a total of 332 rules in 30 ms. Remains 155 /323 variables (removed 168) and now considering 130/298 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 155/323 places, 130/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 298/298 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 308 transition count 283
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 308 transition count 283
Applied a total of 30 rules in 6 ms. Remains 308 /323 variables (removed 15) and now considering 283/298 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 308/323 places, 283/298 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:50:42] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:50:42] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-29 05:50:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 298 transitions and 836 arcs took 3 ms.
Total runtime 62600 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-005B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 323
TRANSITIONS: 298
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1568
MODEL NAME: /home/mcc/execution/412/model
323 places, 298 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="ShieldPPPs-PT-005B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldPPPs-PT-005B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-005B.tgz
mv ShieldPPPs-PT-005B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;