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.r472-tajo-171620399600467.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 ltsminxred
Input is BusinessProcesses-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 63K 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-03-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225033520

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:15] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-01 06:57:15] [INFO ] Transformed 274 places.
[2024-06-01 06:57:15] [INFO ] Transformed 237 transitions.
[2024-06-01 06:57:15] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:15] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 236
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 233 transition count 197
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 233 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 233 transition count 196
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 217 transition count 180
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 217 transition count 180
Applied a total of 112 rules in 82 ms. Remains 217 /273 variables (removed 56) and now considering 180/236 (removed 56) transitions.
// Phase 1: matrix 180 rows 217 cols
[2024-06-01 06:57:15] [INFO ] Computed 42 invariants in 17 ms
[2024-06-01 06:57:15] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 06:57:15] [INFO ] Invariant cache hit.
[2024-06-01 06:57:16] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-06-01 06:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/217 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 18 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 4 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 3 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 19/181 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 3 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 15/199 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 12/215 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 9/224 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:45] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/397 variables, and 244 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 202/202 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/217 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 202/244 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:47] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 180/397 variables, 217/477 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 179/656 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 5 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 13/669 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 4/673 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 673 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 235/235 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 217/273 places, 180/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60640 ms. Remains : 217/273 places, 180/236 transitions.
Support contains 33 out of 217 places after structural reductions.
[2024-06-01 06:58:16] [INFO ] Flatten gal took : 48 ms
[2024-06-01 06:58:16] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:58:16] [INFO ] Input system was already deterministic with 180 transitions.
RANDOM walk for 40000 steps (468 resets) in 1287 ms. (31 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40003 steps (86 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 35669 steps (73 resets) in 105 ms. (336 steps per ms) remains 0/2 properties
Computed a total of 210 stabilizing places and 172 stable transitions
Graph (complete) has 453 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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((X(p0)||F(p1)))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 114 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 209 transition count 146
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 183 transition count 146
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 54 place count 183 transition count 106
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 142 place count 135 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 150 place count 127 transition count 98
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 127 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 127 transition count 97
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 160 place count 126 transition count 97
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 279 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 65 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 64 transition count 37
Applied a total of 281 rules in 52 ms. Remains 64 /217 variables (removed 153) and now considering 37/180 (removed 143) transitions.
// Phase 1: matrix 37 rows 64 cols
[2024-06-01 06:58:17] [INFO ] Computed 31 invariants in 1 ms
[2024-06-01 06:58:17] [INFO ] Implicit Places using invariants in 62 ms returned [1, 13, 53]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/217 places, 37/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 61/217 places, 37/180 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-00
Product exploration explored 100000 steps with 22064 reset in 248 ms.
Product exploration explored 100000 steps with 22032 reset in 197 ms.
Computed a total of 61 stabilizing places and 36 stable transitions
Computed a total of 61 stabilizing places and 36 stable transitions
Detected a total of 61/61 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2731 steps (791 resets) in 55 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 61 cols
[2024-06-01 06:58:19] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 06:58:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 06:58:19] [INFO ] Invariant cache hit.
[2024-06-01 06:58:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 128 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/61 places, 37/37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 33 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 28 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 26 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 26 transition count 30
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 25 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 24 place count 21 transition count 25
Applied a total of 24 rules in 6 ms. Remains 21 /33 variables (removed 12) and now considering 25/37 (removed 12) transitions.
// Phase 1: matrix 25 rows 21 cols
[2024-06-01 06:58:19] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:58:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:58:19] [INFO ] Invariant cache hit.
[2024-06-01 06:58:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/61 places, 25/37 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 21/61 places, 25/37 transitions.
Computed a total of 21 stabilizing places and 24 stable transitions
Computed a total of 21 stabilizing places and 24 stable transitions
Detected a total of 21/21 stabilizing places and 24/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3470 steps (1106 resets) in 49 ms. (69 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 646 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24291 reset in 76 ms.
Product exploration explored 100000 steps with 24245 reset in 80 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-06-01 06:58:20] [INFO ] Invariant cache hit.
[2024-06-01 06:58:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:58:20] [INFO ] Invariant cache hit.
[2024-06-01 06:58:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 06:58:21] [INFO ] Redundant transitions in 33 ms returned []
Running 22 sub problems to find dead transitions.
[2024-06-01 06:58:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 24/44 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 21 constraints, problems are : Problem set: 0 solved, 22 unsolved in 215 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 24/44 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 43 constraints, problems are : Problem set: 0 solved, 22 unsolved in 220 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 21/21 places, 25/25 transitions.
Treatment of property BusinessProcesses-PT-03-LTLCardinality-00 finished in 4156 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))))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 15 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-06-01 06:58:21] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 06:58:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:58:21] [INFO ] Invariant cache hit.
[2024-06-01 06:58:21] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 06:58:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10413 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 40452ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40457ms
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40686 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1235 steps with 14 reset in 5 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-01 finished in 40866 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(F((p0&&F(p1)))))'
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 9 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
[2024-06-01 06:59:02] [INFO ] Invariant cache hit.
[2024-06-01 06:59:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:59:02] [INFO ] Invariant cache hit.
[2024-06-01 06:59:02] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 06:59:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10393 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 40423ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40425ms
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40666 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-02
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-02 finished in 40818 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(G(p0)))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 203 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 203 transition count 167
Applied a total of 27 rules in 8 ms. Remains 203 /217 variables (removed 14) and now considering 167/180 (removed 13) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-06-01 06:59:43] [INFO ] Computed 41 invariants in 1 ms
[2024-06-01 06:59:43] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 06:59:43] [INFO ] Invariant cache hit.
[2024-06-01 06:59:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 06:59:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/370 variables, 203/292 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 11/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 303 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10483 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 59/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/471 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 7/478 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:00:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
[2024-06-01 07:00:02] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:02] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:00:06] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 487 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 77/77 constraints]
After SMT, in 40519ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 40524ms
Starting structural reductions in LTL mode, iteration 1 : 203/217 places, 167/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40775 ms. Remains : 203/217 places, 167/180 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 6044 steps with 76 reset in 20 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-03 finished in 40909 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(F(p0))))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 6 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-06-01 07:00:24] [INFO ] Computed 41 invariants in 4 ms
[2024-06-01 07:00:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:00:24] [INFO ] Invariant cache hit.
[2024-06-01 07:00:24] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 07:00:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 2 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:31] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10160 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 4 ms to minimize.
[2024-06-01 07:00:35] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 36 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 488 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 80/80 constraints]
After SMT, in 40191ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40193ms
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40422 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 204 ms.
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Computed a total of 196 stabilizing places and 158 stable transitions
Graph (complete) has 429 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 158 stable transitions
Detected a total of 196/202 stabilizing places and 158/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLCardinality-05 finished in 40895 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))&&F(G(p2))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 113 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 210 transition count 148
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 185 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 184 transition count 147
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 54 place count 184 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 143 place count 135 transition count 107
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 127 transition count 99
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 127 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 159 place count 127 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 126 transition count 98
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 275 place count 68 transition count 42
Applied a total of 275 rules in 39 ms. Remains 68 /217 variables (removed 149) and now considering 42/180 (removed 138) transitions.
// Phase 1: matrix 42 rows 68 cols
[2024-06-01 07:01:05] [INFO ] Computed 30 invariants in 1 ms
[2024-06-01 07:01:05] [INFO ] Implicit Places using invariants in 55 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/217 places, 42/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 67/217 places, 42/180 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-06
Stuttering criterion allowed to conclude after 23 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-06 finished in 232 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((G(F(p0))&&F((p1||G(p0))))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 203 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 203 transition count 167
Applied a total of 27 rules in 11 ms. Remains 203 /217 variables (removed 14) and now considering 167/180 (removed 13) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-06-01 07:01:05] [INFO ] Computed 41 invariants in 4 ms
[2024-06-01 07:01:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 07:01:05] [INFO ] Invariant cache hit.
[2024-06-01 07:01:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 07:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/370 variables, 203/273 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 278 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9728 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 34/75 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/284 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/450 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 16/466 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/370 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 479 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 69/69 constraints]
After SMT, in 39756ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 39758ms
Starting structural reductions in LTL mode, iteration 1 : 203/217 places, 167/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40002 ms. Remains : 203/217 places, 167/180 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-07
Stuttering criterion allowed to conclude after 128 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-07 finished in 40158 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 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 110 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 446 edges and 212 vertex of which 211 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 210 transition count 148
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 186 transition count 148
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 50 place count 186 transition count 105
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 133 transition count 105
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 125 transition count 97
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 125 transition count 97
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 278 place count 66 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 65 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 64 transition count 39
Applied a total of 280 rules in 17 ms. Remains 64 /217 variables (removed 153) and now considering 39/180 (removed 141) transitions.
// Phase 1: matrix 39 rows 64 cols
[2024-06-01 07:01:45] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 07:01:45] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 13]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 43 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/217 places, 39/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 53/217 places, 39/180 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-10 finished in 133 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)&&F(p1)&&X(G(p2))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 209 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 209 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 207 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 207 transition count 171
Applied a total of 19 rules in 6 ms. Remains 207 /217 variables (removed 10) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-06-01 07:01:45] [INFO ] Computed 41 invariants in 1 ms
[2024-06-01 07:01:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 07:01:45] [INFO ] Invariant cache hit.
[2024-06-01 07:01:45] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-06-01 07:01:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/378 variables, 207/269 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 285 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9272 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/378 variables, 207/298 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 170/468 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 10/478 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 478 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16810 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 60/60 constraints]
After SMT, in 26103ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 26105ms
Starting structural reductions in LTL mode, iteration 1 : 207/217 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26287 ms. Remains : 207/217 places, 171/180 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-11
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-11 finished in 26487 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 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 115 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 209 transition count 146
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 183 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 182 transition count 145
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 56 place count 182 transition count 104
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 147 place count 132 transition count 104
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 124 transition count 96
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 124 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 163 place count 124 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 123 transition count 95
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 283 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 61 transition count 36
Applied a total of 285 rules in 34 ms. Remains 61 /217 variables (removed 156) and now considering 36/180 (removed 144) transitions.
// Phase 1: matrix 36 rows 61 cols
[2024-06-01 07:02:12] [INFO ] Computed 29 invariants in 0 ms
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants in 41 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/217 places, 36/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 60/217 places, 36/180 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 159 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((p0||(p1&&(G(p0) U G(p2))))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 204 transition count 168
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 204 transition count 168
Applied a total of 25 rules in 7 ms. Remains 204 /217 variables (removed 13) and now considering 168/180 (removed 12) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-06-01 07:02:12] [INFO ] Computed 41 invariants in 7 ms
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 07:02:12] [INFO ] Invariant cache hit.
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 13/300 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 301 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12783 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 56/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/468 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 476 constraints, problems are : Problem set: 0 solved, 167 unsolved in 20178 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 64/64 constraints]
After SMT, in 32987ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 32990ms
Starting structural reductions in LTL mode, iteration 1 : 204/217 places, 168/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33214 ms. Remains : 204/217 places, 168/180 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 1170 reset in 171 ms.
Product exploration explored 100000 steps with 1173 reset in 174 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 432 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 742 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 10 factoid took 783 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 07:02:47] [INFO ] Invariant cache hit.
[2024-06-01 07:02:47] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2024-06-01 07:02:47] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 07:02:47] [INFO ] Computed and/alt/rep : 166/292/166 causal constraints (skipped 1 transitions) in 12 ms.
[2024-06-01 07:02:48] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-06-01 07:02:48] [INFO ] Invariant cache hit.
[2024-06-01 07:02:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 07:02:48] [INFO ] Invariant cache hit.
[2024-06-01 07:02:48] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:02:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:51] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 13 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 13/300 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 301 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13008 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 56/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/468 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:02] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:07] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:03:08] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 476 constraints, problems are : Problem set: 0 solved, 167 unsolved in 20151 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 64/64 constraints]
After SMT, in 33181ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 33184ms
Finished structural reductions in LTL mode , in 1 iterations and 33377 ms. Remains : 204/204 places, 168/168 transitions.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 432 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 07:03:21] [INFO ] Invariant cache hit.
[2024-06-01 07:03:21] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2024-06-01 07:03:22] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-01 07:03:22] [INFO ] Computed and/alt/rep : 166/292/166 causal constraints (skipped 1 transitions) in 8 ms.
[2024-06-01 07:03:22] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1200 reset in 152 ms.
Product exploration explored 100000 steps with 1189 reset in 172 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Graph (trivial) has 104 edges and 204 vertex of which 6 / 204 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 199 transition count 162
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 25 place count 199 transition count 188
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 54 place count 199 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 191 transition count 173
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 191 transition count 173
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 143 place count 191 transition count 173
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 159 place count 175 transition count 157
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 175 place count 175 transition count 157
Deduced a syphon composed of 102 places in 0 ms
Applied a total of 175 rules in 33 ms. Remains 175 /204 variables (removed 29) and now considering 157/168 (removed 11) transitions.
[2024-06-01 07:03:22] [INFO ] Redundant transitions in 18 ms returned []
Running 156 sub problems to find dead transitions.
// Phase 1: matrix 157 rows 175 cols
[2024-06-01 07:03:22] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 07:03:22] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/61 constraints. Problems are: Problem set: 61 solved, 95 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/81 constraints. Problems are: Problem set: 118 solved, 38 unsolved
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/82 constraints. Problems are: Problem set: 119 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 119 solved, 37 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 6 (OVERLAPS) 156/331 variables, 175/257 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 5/262 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/262 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/332 variables, 1/263 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/263 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/263 constraints. Problems are: Problem set: 121 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 263 constraints, problems are : Problem set: 121 solved, 35 unsolved in 3403 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 175/175 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 121 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 101/173 variables, 41/41 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 41/82 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/82 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 156/329 variables, 173/255 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 5/260 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 35/295 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/295 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/331 variables, 2/297 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/297 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/298 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/298 constraints. Problems are: Problem set: 121 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/298 constraints. Problems are: Problem set: 121 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 298 constraints, problems are : Problem set: 121 solved, 35 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 175/175 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 35/156 constraints, Known Traps: 41/41 constraints]
After SMT, in 6027ms problems are : Problem set: 121 solved, 35 unsolved
Search for dead transitions found 121 dead transitions in 6031ms
Found 121 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 121 transitions
Dead transitions reduction (with SMT) removed 121 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 175/204 places, 36/168 transitions.
Graph (complete) has 294 edges and 175 vertex of which 73 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.0 ms
Discarding 102 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Applied a total of 1 rules in 4 ms. Remains 61 /175 variables (removed 114) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/204 places, 36/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6096 ms. Remains : 61/204 places, 36/168 transitions.
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 203 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 203 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 202 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 202 transition count 166
Applied a total of 4 rules in 12 ms. Remains 202 /204 variables (removed 2) and now considering 166/168 (removed 2) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-06-01 07:03:28] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 07:03:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 07:03:28] [INFO ] Invariant cache hit.
[2024-06-01 07:03:29] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 07:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9456 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:44] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 39488ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39490ms
Starting structural reductions in LTL mode, iteration 1 : 202/204 places, 166/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39745 ms. Remains : 202/204 places, 166/168 transitions.
Treatment of property BusinessProcesses-PT-03-LTLCardinality-15 finished in 116478 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((X(p0)||F(p1)))))'
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((p0||(p1&&(G(p0) U G(p2))))))'
[2024-06-01 07:04:08] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:04:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 217 places, 180 transitions and 517 arcs took 4 ms.
Total runtime 413844 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-03-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BusinessProcesses-PT-03-LTLCardinality-15

BK_STOP 1717225739158

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-03-LTLCardinality-00
ltl formula formula --ltl=/tmp/3945/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 217 places, 180 transitions and 517 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3945/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3945/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3945/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3945/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 217 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 218, there are 213 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~68 levels ~10000 states ~44276 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~20000 states ~93704 transitions
pnml2lts-mc( 3/ 4): ~181 levels ~40000 states ~222492 transitions
pnml2lts-mc( 3/ 4): ~181 levels ~80000 states ~469980 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~160000 states ~930116 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~320000 states ~2013092 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~640000 states ~4248804 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~1280000 states ~9115816 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~2560000 states ~19510144 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~5120000 states ~43631976 transitions
pnml2lts-mc( 3/ 4): ~218 levels ~10240000 states ~88477412 transitions
pnml2lts-mc( 3/ 4): ~218 levels ~20480000 states ~186212924 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19095709
pnml2lts-mc( 0/ 4): unique states count: 33552688
pnml2lts-mc( 0/ 4): unique transitions count: 321186845
pnml2lts-mc( 0/ 4): - self-loop count: 18
pnml2lts-mc( 0/ 4): - claim dead count: 282488617
pnml2lts-mc( 0/ 4): - claim found count: 5819557
pnml2lts-mc( 0/ 4): - claim success count: 33679313
pnml2lts-mc( 0/ 4): - cum. max stack depth: 813
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33688982 states 322524933 transitions, fanout: 9.574
pnml2lts-mc( 0/ 4): Total exploration time 171.770 sec (171.740 sec minimum, 171.763 sec on average)
pnml2lts-mc( 0/ 4): States per second: 196128, Transitions per second: 1877656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 301.2MB, 9.4 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/70.0%
pnml2lts-mc( 0/ 4): Stored 180 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 301.2MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-03-LTLCardinality-15
ltl formula formula --ltl=/tmp/3945/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 217 places, 180 transitions and 517 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3945/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3945/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3945/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3945/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 218 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 218, there are 212 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~176 levels ~10000 states ~42164 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~20000 states ~93680 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~40000 states ~204584 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~80000 states ~448152 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~160000 states ~976752 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~320000 states ~2075504 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~640000 states ~4471288 transitions
pnml2lts-mc( 0/ 4): ~176 levels ~1280000 states ~9584484 transitions
pnml2lts-mc( 0/ 4): ~199 levels ~2560000 states ~20039180 transitions
pnml2lts-mc( 0/ 4): ~199 levels ~5120000 states ~42690844 transitions
pnml2lts-mc( 3/ 4): ~67 levels ~10240000 states ~85109996 transitions
pnml2lts-mc( 3/ 4): ~67 levels ~20480000 states ~180586968 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17106327
pnml2lts-mc( 0/ 4): unique states count: 23386827
pnml2lts-mc( 0/ 4): unique transitions count: 216196801
pnml2lts-mc( 0/ 4): - self-loop count: 16
pnml2lts-mc( 0/ 4): - claim dead count: 192129930
pnml2lts-mc( 0/ 4): - claim found count: 2633857
pnml2lts-mc( 0/ 4): - claim success count: 23725575
pnml2lts-mc( 0/ 4): - cum. max stack depth: 554
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23766085 states 220055803 transitions, fanout: 9.259
pnml2lts-mc( 0/ 4): Total exploration time 117.390 sec (117.370 sec minimum, 117.382 sec on average)
pnml2lts-mc( 0/ 4): States per second: 202454, Transitions per second: 1874570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 242.4MB, 10.9 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 69.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 180 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 242.4MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-03, 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 r472-tajo-171620399600467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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