Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399700515.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716334336359

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:32:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:32:18] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 23:32:18] [INFO ] Transformed 403 places.
[2024-05-21 23:32:18] [INFO ] Transformed 374 transitions.
[2024-05-21 23:32:18] [INFO ] Found NUPN structural information;
[2024-05-21 23:32:18] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BusinessProcesses-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 55 place count 348 transition count 320
Iterating global reduction 1 with 54 rules applied. Total rules applied 109 place count 348 transition count 320
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 133 place count 324 transition count 296
Iterating global reduction 1 with 24 rules applied. Total rules applied 157 place count 324 transition count 296
Applied a total of 157 rules in 147 ms. Remains 324 /403 variables (removed 79) and now considering 296/374 (removed 78) transitions.
// Phase 1: matrix 296 rows 324 cols
[2024-05-21 23:32:18] [INFO ] Computed 64 invariants in 23 ms
[2024-05-21 23:32:20] [INFO ] Implicit Places using invariants in 1832 ms returned []
[2024-05-21 23:32:20] [INFO ] Invariant cache hit.
[2024-05-21 23:32:20] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-21 23:32:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 24 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 5 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 20/104 constraints. Problems are: Problem set: 14 solved, 281 unsolved
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 281 unsolved
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 4 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 4 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 4 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 20/144 constraints. Problems are: Problem set: 23 solved, 272 unsolved
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 20/164 constraints. Problems are: Problem set: 26 solved, 269 unsolved
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 20/184 constraints. Problems are: Problem set: 26 solved, 269 unsolved
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 20/204 constraints. Problems are: Problem set: 26 solved, 269 unsolved
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/620 variables, and 217 constraints, problems are : Problem set: 26 solved, 269 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/324 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 26 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 28/28 constraints. Problems are: Problem set: 26 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/28 constraints. Problems are: Problem set: 26 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 34/62 constraints. Problems are: Problem set: 26 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 2/64 constraints. Problems are: Problem set: 26 solved, 269 unsolved
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 153/217 constraints. Problems are: Problem set: 28 solved, 267 unsolved
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 20/237 constraints. Problems are: Problem set: 30 solved, 265 unsolved
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/257 constraints. Problems are: Problem set: 34 solved, 261 unsolved
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
Problem TDEAD240 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 19/276 constraints. Problems are: Problem set: 36 solved, 259 unsolved
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 20/296 constraints. Problems are: Problem set: 36 solved, 259 unsolved
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 15/311 constraints. Problems are: Problem set: 36 solved, 259 unsolved
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 15 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 14 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 9/320 constraints. Problems are: Problem set: 36 solved, 259 unsolved
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 3/323 constraints. Problems are: Problem set: 36 solved, 259 unsolved
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/620 variables, and 324 constraints, problems are : Problem set: 36 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/324 constraints, PredecessorRefiner: 0/295 constraints, Known Traps: 260/260 constraints]
After SMT, in 60228ms problems are : Problem set: 36 solved, 259 unsolved
Search for dead transitions found 36 dead transitions in 60280ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 324/403 places, 260/374 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 321 transition count 260
Applied a total of 3 rules in 12 ms. Remains 321 /324 variables (removed 3) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 321 cols
[2024-05-21 23:33:21] [INFO ] Computed 70 invariants in 5 ms
[2024-05-21 23:33:21] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 23:33:21] [INFO ] Invariant cache hit.
[2024-05-21 23:33:21] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 321/403 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63325 ms. Remains : 321/403 places, 260/374 transitions.
Support contains 19 out of 321 places after structural reductions.
[2024-05-21 23:33:21] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:33:21] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:33:21] [INFO ] Input system was already deterministic with 260 transitions.
RANDOM walk for 38842 steps (405 resets) in 981 ms. (39 steps per ms) remains 0/11 properties
Computed a total of 191 stabilizing places and 160 stable transitions
Graph (complete) has 669 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 316 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 316 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 315 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 315 transition count 254
Applied a total of 12 rules in 24 ms. Remains 315 /321 variables (removed 6) and now considering 254/260 (removed 6) transitions.
// Phase 1: matrix 254 rows 315 cols
[2024-05-21 23:33:22] [INFO ] Computed 70 invariants in 9 ms
[2024-05-21 23:33:22] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:33:22] [INFO ] Invariant cache hit.
[2024-05-21 23:33:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-21 23:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 14/164 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 13/177 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/569 variables, and 226 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 156/156 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 156/226 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 16/242 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 11/262 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 11/276 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/569 variables, and 283 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 0/253 constraints, Known Traps: 213/213 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 315/321 places, 254/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60519 ms. Remains : 315/321 places, 254/260 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2750 steps with 27 reset in 32 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-00 finished in 60872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Graph (trivial) has 146 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 662 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 314 transition count 222
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 284 transition count 222
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 62 place count 284 transition count 154
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 208 place count 206 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 203 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 203 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 203 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 202 transition count 150
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 388 place count 110 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 109 transition count 73
Applied a total of 390 rules in 88 ms. Remains 109 /321 variables (removed 212) and now considering 73/260 (removed 187) transitions.
// Phase 1: matrix 73 rows 109 cols
[2024-05-21 23:34:23] [INFO ] Computed 48 invariants in 1 ms
[2024-05-21 23:34:23] [INFO ] Implicit Places using invariants in 107 ms returned [1, 2, 3, 11, 26, 27, 28, 29, 30, 31, 32]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 121 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/321 places, 73/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 98/321 places, 73/260 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-01 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Graph (trivial) has 144 edges and 321 vertex of which 4 / 321 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 666 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 224
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 285 transition count 224
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 64 place count 285 transition count 157
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 208 place count 208 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 212 place count 204 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 204 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 216 place count 204 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 218 place count 203 transition count 152
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 388 place count 112 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 111 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 111 transition count 76
Applied a total of 391 rules in 35 ms. Remains 111 /321 variables (removed 210) and now considering 76/260 (removed 184) transitions.
// Phase 1: matrix 76 rows 111 cols
[2024-05-21 23:34:23] [INFO ] Computed 48 invariants in 1 ms
[2024-05-21 23:34:23] [INFO ] Implicit Places using invariants in 109 ms returned [1, 2, 3, 11, 26, 27, 28, 29, 30, 31, 32]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 109 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/321 places, 76/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 100/321 places, 76/260 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-02 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Graph (trivial) has 144 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 662 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 313 transition count 221
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 283 transition count 221
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 62 place count 283 transition count 156
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 200 place count 210 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 207 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 207 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 207 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 206 transition count 152
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 380 place count 114 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 113 transition count 75
Applied a total of 382 rules in 29 ms. Remains 113 /321 variables (removed 208) and now considering 75/260 (removed 185) transitions.
// Phase 1: matrix 75 rows 113 cols
[2024-05-21 23:34:23] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 23:34:23] [INFO ] Implicit Places using invariants in 97 ms returned [1, 2, 3, 11, 24, 25, 26, 30, 31, 32, 33, 34, 85]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 99 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/321 places, 75/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 100/321 places, 75/260 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-03 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 316 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 316 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 315 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 315 transition count 254
Applied a total of 12 rules in 20 ms. Remains 315 /321 variables (removed 6) and now considering 254/260 (removed 6) transitions.
// Phase 1: matrix 254 rows 315 cols
[2024-05-21 23:34:24] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:34:24] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 23:34:24] [INFO ] Invariant cache hit.
[2024-05-21 23:34:24] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-21 23:34:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 35/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 17 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 18/168 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 15/206 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 14/220 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/569 variables, and 220 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 150/150 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 35/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 150/220 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 14/234 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 9/272 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/569 variables, and 325 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 0/253 constraints, Known Traps: 255/255 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 315/321 places, 254/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 315/321 places, 254/260 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 8573 steps with 93 reset in 43 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-05 finished in 60788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Graph (trivial) has 147 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 662 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 313 transition count 221
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 283 transition count 221
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 62 place count 283 transition count 152
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 210 place count 204 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 214 place count 200 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 200 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 218 place count 200 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 199 transition count 147
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 386 place count 110 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 109 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 108 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 107 transition count 72
Applied a total of 390 rules in 60 ms. Remains 107 /321 variables (removed 214) and now considering 72/260 (removed 188) transitions.
// Phase 1: matrix 72 rows 107 cols
[2024-05-21 23:35:24] [INFO ] Computed 47 invariants in 1 ms
[2024-05-21 23:35:25] [INFO ] Implicit Places using invariants in 121 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/321 places, 72/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 106/321 places, 72/260 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-13 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(!p1))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 260/260 transitions.
Graph (trivial) has 145 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 662 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 313 transition count 221
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 283 transition count 221
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 62 place count 283 transition count 153
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 207 place count 206 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 202 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 202 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 215 place count 202 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 201 transition count 148
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 381 place count 113 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 383 place count 112 transition count 75
Applied a total of 383 rules in 23 ms. Remains 112 /321 variables (removed 209) and now considering 75/260 (removed 185) transitions.
// Phase 1: matrix 75 rows 112 cols
[2024-05-21 23:35:25] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 23:35:25] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 11, 24, 27, 28, 29, 30, 31, 32, 83]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 166 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/321 places, 75/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 100/321 places, 75/260 transitions.
Stuttering acceptance computed with spot in 96 ms :[p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-14 finished in 311 ms.
All properties solved by simple procedures.
Total runtime 187579 ms.

BK_STOP 1716334525500

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399700515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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