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.r047-tajo-171620398300500.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 greatspnxred
Input is BusinessProcesses-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 100K 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-07-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716304166189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:09:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:09:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:09:27] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 15:09:27] [INFO ] Transformed 386 places.
[2024-05-21 15:09:27] [INFO ] Transformed 360 transitions.
[2024-05-21 15:09:27] [INFO ] Found NUPN structural information;
[2024-05-21 15:09:27] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 338 transition count 313
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 338 transition count 313
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 317 transition count 292
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 317 transition count 292
Applied a total of 137 rules in 70 ms. Remains 317 /386 variables (removed 69) and now considering 292/360 (removed 68) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-05-21 15:09:27] [INFO ] Computed 61 invariants in 28 ms
[2024-05-21 15:09:27] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 15:09:27] [INFO ] Invariant cache hit.
[2024-05-21 15:09:28] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-21 15:09:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 16 ms to minimize.
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:09:32] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:09:33] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:09:34] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 4 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:09:35] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:09:36] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 11 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:37] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:39] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:09:39] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:09:39] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:39] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:09:39] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:09:40] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:41] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:09:42] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:09:43] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:09:44] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:09:44] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 15:09:44] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:09:44] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:44] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:09:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:09:46] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/181 constraints. Problems are: Problem set: 6 solved, 285 unsolved
[2024-05-21 15:09:48] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:09:48] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:09:49] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:09:50] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/201 constraints. Problems are: Problem set: 9 solved, 282 unsolved
[2024-05-21 15:09:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:09:51] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:09:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:09:51] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:09:52] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 4 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:09:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/221 constraints. Problems are: Problem set: 22 solved, 269 unsolved
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:09:55] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:09:56] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 4 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:09:57] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 20/241 constraints. Problems are: Problem set: 24 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/609 variables, and 241 constraints, problems are : Problem set: 24 solved, 267 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 24 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 27/27 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/27 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/60 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 1/61 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 180/241 constraints. Problems are: Problem set: 24 solved, 267 unsolved
[2024-05-21 15:10:00] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:10:00] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:10:01] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:10:01] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:10:01] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:10:01] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:10:02] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 3 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:10:03] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/261 constraints. Problems are: Problem set: 27 solved, 264 unsolved
[2024-05-21 15:10:04] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:10:04] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:10:05] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:10:06] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:10:06] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:10:06] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:10:06] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:10:06] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:10:07] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/281 constraints. Problems are: Problem set: 27 solved, 264 unsolved
[2024-05-21 15:10:08] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:10:08] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:10:08] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:10:08] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 3 ms to minimize.
[2024-05-21 15:10:09] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:10] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/301 constraints. Problems are: Problem set: 27 solved, 264 unsolved
[2024-05-21 15:10:12] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:10:12] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:10:13] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:10:14] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:10:14] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:10:14] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:10:14] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:14] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:10:15] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:10:15] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:10:15] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:10:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:10:15] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/321 constraints. Problems are: Problem set: 27 solved, 264 unsolved
[2024-05-21 15:10:18] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:10:18] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:18] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:10:18] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:10:19] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:10:19] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:10:19] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:10:20] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:10:21] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/341 constraints. Problems are: Problem set: 27 solved, 264 unsolved
[2024-05-21 15:10:24] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:10:25] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:10:25] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:10:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:10:26] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:10:27] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:10:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:10:27] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:10:28] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:10:28] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:10:28] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/609 variables, and 357 constraints, problems are : Problem set: 27 solved, 264 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/291 constraints, Known Traps: 296/296 constraints]
After SMT, in 60164ms problems are : Problem set: 27 solved, 264 unsolved
Search for dead transitions found 27 dead transitions in 60192ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/386 places, 265/360 transitions.
Applied a total of 0 rules in 12 ms. Remains 317 /317 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60857 ms. Remains : 317/386 places, 265/360 transitions.
Support contains 54 out of 317 places after structural reductions.
[2024-05-21 15:10:28] [INFO ] Flatten gal took : 51 ms
[2024-05-21 15:10:28] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:10:28] [INFO ] Input system was already deterministic with 265 transitions.
RANDOM walk for 40000 steps (431 resets) in 1747 ms. (22 steps per ms) remains 7/34 properties
BEST_FIRST walk for 40004 steps (74 resets) in 149 ms. (266 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (93 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (80 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
// Phase 1: matrix 265 rows 317 cols
[2024-05-21 15:10:29] [INFO ] Computed 63 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/153 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 73/226 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 7 (OVERLAPS) 85/311 variables, 28/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 15:10:29] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 3 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 10/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/314 variables, 2/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 12 (OVERLAPS) 263/577 variables, 314/393 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/393 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/582 variables, 3/396 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 1/397 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/397 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/582 variables, 0/397 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 397 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/225 variables, 29/33 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 6/39 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:10:30] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 3/42 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/311 variables, 28/70 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 11/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:10:31] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 3 ms to minimize.
Problem AtomicPropp20 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 20/101 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 15:10:32] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 3 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:10:33] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 15/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/314 variables, 2/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 263/577 variables, 314/432 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/577 variables, 1/433 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:10:34] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/577 variables, 7/440 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/582 variables, 3/443 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 15:10:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:10:35] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:10:35] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:10:35] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 4/447 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/582 variables, 0/447 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/582 variables, 0/447 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 447 constraints, problems are : Problem set: 4 solved, 1 unsolved in 4560 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 66/66 constraints]
After SMT, in 5731ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 265/265 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 677 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 311 transition count 223
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 277 transition count 223
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 70 place count 277 transition count 160
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 205 place count 205 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 194 transition count 149
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 194 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 194 transition count 147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 192 transition count 147
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 371 place count 120 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 119 transition count 82
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 119 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 377 place count 117 transition count 80
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 381 place count 117 transition count 80
Applied a total of 381 rules in 90 ms. Remains 117 /317 variables (removed 200) and now considering 80/265 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 117/317 places, 80/265 transitions.
RANDOM walk for 40000 steps (2711 resets) in 764 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6735 steps (191 resets) in 73 ms. (91 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 199 stabilizing places and 174 stable transitions
Graph (complete) has 684 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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((p0||X(X(p0))))) U p1)||G(F(p1))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 252
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 251
Applied a total of 28 rules in 30 ms. Remains 303 /317 variables (removed 14) and now considering 251/265 (removed 14) transitions.
// Phase 1: matrix 251 rows 303 cols
[2024-05-21 15:10:36] [INFO ] Computed 63 invariants in 5 ms
[2024-05-21 15:10:36] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 15:10:36] [INFO ] Invariant cache hit.
[2024-05-21 15:10:36] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 395 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/317 places, 251/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 300/317 places, 251/265 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-00
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 914 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(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 678 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 310 transition count 223
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 276 transition count 223
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 70 place count 276 transition count 160
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 205 place count 204 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 193 transition count 149
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 193 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 191 transition count 147
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 369 place count 120 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 119 transition count 83
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 377 place count 119 transition count 83
Applied a total of 377 rules in 64 ms. Remains 119 /317 variables (removed 198) and now considering 83/265 (removed 182) transitions.
// Phase 1: matrix 83 rows 119 cols
[2024-05-21 15:10:37] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 15:10:37] [INFO ] Implicit Places using invariants in 87 ms returned [4, 12, 20, 37, 38, 39, 40, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 93 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/317 places, 83/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 109/317 places, 83/265 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-01 finished in 206 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(((!p0 U (p1||G(!p0)))&&(p2||X(p3)))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 254
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 254
Applied a total of 22 rules in 9 ms. Remains 306 /317 variables (removed 11) and now considering 254/265 (removed 11) transitions.
// Phase 1: matrix 254 rows 306 cols
[2024-05-21 15:10:37] [INFO ] Computed 63 invariants in 4 ms
[2024-05-21 15:10:37] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 15:10:37] [INFO ] Invariant cache hit.
[2024-05-21 15:10:37] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 408 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 254/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 303 /303 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 303/317 places, 254/265 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-02 finished in 532 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)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 253
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 252
Applied a total of 26 rules in 12 ms. Remains 304 /317 variables (removed 13) and now considering 252/265 (removed 13) transitions.
// Phase 1: matrix 252 rows 304 cols
[2024-05-21 15:10:37] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 15:10:37] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 15:10:37] [INFO ] Invariant cache hit.
[2024-05-21 15:10:38] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 366 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 252/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 301/317 places, 252/265 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03
Product exploration explored 100000 steps with 2056 reset in 299 ms.
Stack based approach found an accepted trace after 158 steps with 3 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 782 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&&X((p0 U (X(!p0)||G(p0))))))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 252
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 251
Applied a total of 28 rules in 15 ms. Remains 303 /317 variables (removed 14) and now considering 251/265 (removed 14) transitions.
// Phase 1: matrix 251 rows 303 cols
[2024-05-21 15:10:38] [INFO ] Computed 63 invariants in 5 ms
[2024-05-21 15:10:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 15:10:38] [INFO ] Invariant cache hit.
[2024-05-21 15:10:38] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 431 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/317 places, 251/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 450 ms. Remains : 300/317 places, 251/265 transitions.
Stuttering acceptance computed with spot in 140 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Computed a total of 183 stabilizing places and 161 stable transitions
Graph (complete) has 650 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 183 stabilizing places and 161 stable transitions
Detected a total of 183/300 stabilizing places and 161/251 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X 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 4 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-04 finished in 1018 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 U p1)||F((G(p2)||(p2&&F(!p1)))))))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 253
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 252
Applied a total of 26 rules in 13 ms. Remains 304 /317 variables (removed 13) and now considering 252/265 (removed 13) transitions.
// Phase 1: matrix 252 rows 304 cols
[2024-05-21 15:10:39] [INFO ] Computed 63 invariants in 4 ms
[2024-05-21 15:10:39] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 15:10:39] [INFO ] Invariant cache hit.
[2024-05-21 15:10:39] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 384 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 252/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 301/317 places, 252/265 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 2670 reset in 316 ms.
Stack based approach found an accepted trace after 51515 steps with 1365 reset with depth 29 and stack size 28 in 125 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 252
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 251
Applied a total of 28 rules in 18 ms. Remains 303 /317 variables (removed 14) and now considering 251/265 (removed 14) transitions.
// Phase 1: matrix 251 rows 303 cols
[2024-05-21 15:10:40] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 15:10:40] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 15:10:40] [INFO ] Invariant cache hit.
[2024-05-21 15:10:41] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 387 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/317 places, 251/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 300/317 places, 251/265 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Computed a total of 183 stabilizing places and 161 stable transitions
Graph (complete) has 650 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 183 stabilizing places and 161 stable transitions
Detected a total of 183/300 stabilizing places and 161/251 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-06 finished in 971 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 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 253
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 252
Applied a total of 26 rules in 12 ms. Remains 304 /317 variables (removed 13) and now considering 252/265 (removed 13) transitions.
// Phase 1: matrix 252 rows 304 cols
[2024-05-21 15:10:41] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 15:10:41] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 15:10:41] [INFO ] Invariant cache hit.
[2024-05-21 15:10:42] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 409 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 252/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 424 ms. Remains : 301/317 places, 252/265 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-07
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-07 finished in 554 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(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Graph (trivial) has 147 edges and 317 vertex of which 6 / 317 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 678 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 310 transition count 221
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 274 transition count 221
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 74 place count 274 transition count 159
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 207 place count 203 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 217 place count 193 transition count 149
Iterating global reduction 2 with 10 rules applied. Total rules applied 227 place count 193 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 191 transition count 147
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 378 place count 115 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 380 place count 114 transition count 79
Applied a total of 380 rules in 49 ms. Remains 114 /317 variables (removed 203) and now considering 79/265 (removed 186) transitions.
// Phase 1: matrix 79 rows 114 cols
[2024-05-21 15:10:42] [INFO ] Computed 49 invariants in 0 ms
[2024-05-21 15:10:42] [INFO ] Implicit Places using invariants in 95 ms returned [1, 2, 10, 33, 34, 35, 36, 37, 38, 39]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 96 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/317 places, 79/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 104/317 places, 79/265 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-08
Stuttering criterion allowed to conclude after 706 steps with 147 reset in 4 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-08 finished in 216 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 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 252
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 251
Applied a total of 28 rules in 15 ms. Remains 303 /317 variables (removed 14) and now considering 251/265 (removed 14) transitions.
// Phase 1: matrix 251 rows 303 cols
[2024-05-21 15:10:42] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 15:10:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 15:10:42] [INFO ] Invariant cache hit.
[2024-05-21 15:10:42] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 426 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/317 places, 251/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 445 ms. Remains : 300/317 places, 251/265 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-09
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-09 finished in 616 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||F(p1)))||G(p2))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 253
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 252
Applied a total of 26 rules in 18 ms. Remains 304 /317 variables (removed 13) and now considering 252/265 (removed 13) transitions.
// Phase 1: matrix 252 rows 304 cols
[2024-05-21 15:10:43] [INFO ] Computed 63 invariants in 2 ms
[2024-05-21 15:10:43] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 15:10:43] [INFO ] Invariant cache hit.
[2024-05-21 15:10:43] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 401 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 252/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 423 ms. Remains : 301/317 places, 252/265 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 1105 reset in 220 ms.
Product exploration explored 100000 steps with 1099 reset in 204 ms.
Computed a total of 184 stabilizing places and 162 stable transitions
Graph (complete) has 651 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 184 stabilizing places and 162 stable transitions
Detected a total of 184/301 stabilizing places and 162/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 344 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (443 resets) in 448 ms. (89 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (55 resets) in 122 ms. (325 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (57 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
// Phase 1: matrix 252 rows 301 cols
[2024-05-21 15:10:45] [INFO ] Computed 60 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 110/209 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/294 variables, 26/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/298 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 250/548 variables, 298/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/553 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/553 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 99/553 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 6/32 constraints, Generalized P Invariants (flows): 0/28 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 883 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 252/252 transitions.
Graph (complete) has 651 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 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 26 place count 299 transition count 225
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 274 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 272 transition count 223
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 55 place count 272 transition count 160
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 189 place count 201 transition count 160
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 346 place count 120 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 347 place count 120 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 119 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 350 place count 118 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 351 place count 117 transition count 85
Applied a total of 351 rules in 42 ms. Remains 117 /301 variables (removed 184) and now considering 85/252 (removed 167) transitions.
// Phase 1: matrix 85 rows 117 cols
[2024-05-21 15:10:46] [INFO ] Computed 46 invariants in 2 ms
[2024-05-21 15:10:46] [INFO ] Implicit Places using invariants in 93 ms returned [35, 36, 37, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/301 places, 85/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 113/301 places, 85/252 transitions.
Computed a total of 68 stabilizing places and 58 stable transitions
Computed a total of 68 stabilizing places and 58 stable transitions
Detected a total of 68/113 stabilizing places and 58/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 753 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3657 resets) in 142 ms. (279 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (848 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
// Phase 1: matrix 85 rows 113 cols
[2024-05-21 15:10:47] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 15:10:47] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/81 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/85 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/92 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 85/177 variables, 92/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 21/198 variables, 21/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 41/198 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 5/25 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/113 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 1334 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9143 reset in 219 ms.
Product exploration explored 100000 steps with 9203 reset in 251 ms.
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 85/85 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-21 15:10:49] [INFO ] Invariant cache hit.
[2024-05-21 15:10:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 15:10:50] [INFO ] Invariant cache hit.
[2024-05-21 15:10:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:10:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [24, 26, 28, 63, 69, 71, 97, 99, 105]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 255 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/113 places, 85/85 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 102 transition count 83
Applied a total of 4 rules in 5 ms. Remains 102 /104 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 102 cols
[2024-05-21 15:10:50] [INFO ] Computed 33 invariants in 2 ms
[2024-05-21 15:10:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 15:10:50] [INFO ] Invariant cache hit.
[2024-05-21 15:10:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:10:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/113 places, 83/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 102/113 places, 83/85 transitions.
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 7368 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(G(p0))&&F(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 678 edges and 312 vertex of which 311 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 310 transition count 222
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 275 transition count 222
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 72 place count 275 transition count 159
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 207 place count 203 transition count 159
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 216 place count 194 transition count 150
Iterating global reduction 2 with 9 rules applied. Total rules applied 225 place count 194 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 225 place count 194 transition count 148
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 229 place count 192 transition count 148
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 374 place count 117 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 116 transition count 81
Applied a total of 376 rules in 26 ms. Remains 116 /317 variables (removed 201) and now considering 81/265 (removed 184) transitions.
// Phase 1: matrix 81 rows 116 cols
[2024-05-21 15:10:50] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 15:10:50] [INFO ] Implicit Places using invariants in 80 ms returned [1, 2, 10, 33, 34, 35, 36, 37, 38, 39]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 82 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/317 places, 81/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 106/317 places, 81/265 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 20542 reset in 180 ms.
Product exploration explored 100000 steps with 20571 reset in 196 ms.
Computed a total of 66 stabilizing places and 55 stable transitions
Computed a total of 66 stabilizing places and 55 stable transitions
Detected a total of 66/106 stabilizing places and 55/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 14477 steps (2984 resets) in 259 ms. (55 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 106 cols
[2024-05-21 15:10:52] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 15:10:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 15:10:52] [INFO ] Invariant cache hit.
[2024-05-21 15:10:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:10:52] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [10, 11, 12, 13, 24, 26, 28, 31, 53, 55, 61, 63, 90, 92, 98]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 236 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/106 places, 81/81 transitions.
Graph (complete) has 293 edges and 91 vertex of which 82 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
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 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 81 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 78 transition count 73
Applied a total of 9 rules in 5 ms. Remains 78 /91 variables (removed 13) and now considering 73/81 (removed 8) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-21 15:10:52] [INFO ] Computed 22 invariants in 0 ms
[2024-05-21 15:10:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 15:10:52] [INFO ] Invariant cache hit.
[2024-05-21 15:10:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:10:52] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/106 places, 73/81 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 418 ms. Remains : 78/106 places, 73/81 transitions.
Computed a total of 38 stabilizing places and 47 stable transitions
Computed a total of 38 stabilizing places and 47 stable transitions
Detected a total of 38/78 stabilizing places and 47/73 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 6648 steps (1404 resets) in 21 ms. (302 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20885 reset in 180 ms.
Product exploration explored 100000 steps with 20948 reset in 162 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-05-21 15:10:53] [INFO ] Invariant cache hit.
[2024-05-21 15:10:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 15:10:54] [INFO ] Invariant cache hit.
[2024-05-21 15:10:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:10:54] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 15:10:54] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 15:10:54] [INFO ] Invariant cache hit.
[2024-05-21 15:10:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:10:54] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 8 (OVERLAPS) 72/150 variables, 78/112 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 4/116 constraints. Problems are: Problem set: 9 solved, 59 unsolved
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 2 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:10:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:10:56] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 17/133 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/151 variables, and 133 constraints, problems are : Problem set: 9 solved, 59 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 9 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 4/5 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 11/16 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 15/31 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 2/33 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 18/51 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 72/150 variables, 78/129 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 4/133 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 59/192 constraints. Problems are: Problem set: 9 solved, 59 unsolved
[2024-05-21 15:10:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:10:57] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:10:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:10:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:10:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:10:58] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 6/198 constraints. Problems are: Problem set: 9 solved, 59 unsolved
[2024-05-21 15:10:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/199 constraints. Problems are: Problem set: 9 solved, 59 unsolved
[2024-05-21 15:10:59] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:10:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:10:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:10:59] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 4/203 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/203 constraints. Problems are: Problem set: 9 solved, 59 unsolved
At refinement iteration 15 (OVERLAPS) 0/150 variables, 0/203 constraints. Problems are: Problem set: 9 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/151 variables, and 203 constraints, problems are : Problem set: 9 solved, 59 unsolved in 4393 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 59/68 constraints, Known Traps: 40/40 constraints]
After SMT, in 7499ms problems are : Problem set: 9 solved, 59 unsolved
Search for dead transitions found 9 dead transitions in 7503ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 64/73 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 6 ms. Remains 77 /78 variables (removed 1) and now considering 64/64 (removed 0) transitions.
[2024-05-21 15:11:01] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 7719 ms. Remains : 77/78 places, 64/73 transitions.
Treatment of property BusinessProcesses-PT-07-LTLFireability-13 finished in 11235 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)||G((F(p0)||(F(p1) U p2)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 252
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 251
Applied a total of 28 rules in 14 ms. Remains 303 /317 variables (removed 14) and now considering 251/265 (removed 14) transitions.
// Phase 1: matrix 251 rows 303 cols
[2024-05-21 15:11:01] [INFO ] Computed 63 invariants in 3 ms
[2024-05-21 15:11:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 15:11:01] [INFO ] Invariant cache hit.
[2024-05-21 15:11:02] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 435 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/317 places, 251/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 452 ms. Remains : 300/317 places, 251/265 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 638 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((X(F(p0))&&G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 254
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 305 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 305 transition count 253
Applied a total of 24 rules in 13 ms. Remains 305 /317 variables (removed 12) and now considering 253/265 (removed 12) transitions.
// Phase 1: matrix 253 rows 305 cols
[2024-05-21 15:11:02] [INFO ] Computed 63 invariants in 5 ms
[2024-05-21 15:11:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 15:11:02] [INFO ] Invariant cache hit.
[2024-05-21 15:11:02] [INFO ] Implicit Places using invariants and state equation in 302 ms returned [69, 70, 71]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 457 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 253/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 473 ms. Remains : 302/317 places, 253/265 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-15 finished in 726 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||F(p1)))||G(p2))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-07-LTLFireability-12
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 265/265 transitions.
Graph (complete) has 684 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 315 transition count 232
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 284 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 282 transition count 230
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 67 place count 282 transition count 167
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 201 place count 211 transition count 167
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 211 place count 201 transition count 157
Iterating global reduction 3 with 10 rules applied. Total rules applied 221 place count 201 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 221 place count 201 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 199 transition count 155
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 372 place count 123 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 123 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 375 place count 122 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 121 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 120 transition count 85
Applied a total of 377 rules in 24 ms. Remains 120 /317 variables (removed 197) and now considering 85/265 (removed 180) transitions.
// Phase 1: matrix 85 rows 120 cols
[2024-05-21 15:11:03] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 15:11:03] [INFO ] Implicit Places using invariants in 85 ms returned [38, 39, 40, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 116/317 places, 85/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 113 ms. Remains : 116/317 places, 85/265 transitions.
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 9247 reset in 189 ms.
Product exploration explored 100000 steps with 9134 reset in 211 ms.
Computed a total of 71 stabilizing places and 58 stable transitions
Computed a total of 71 stabilizing places and 58 stable transitions
Detected a total of 71/116 stabilizing places and 58/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 936 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (3636 resets) in 284 ms. (140 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (869 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (876 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
// Phase 1: matrix 85 rows 116 cols
[2024-05-21 15:11:05] [INFO ] Computed 45 invariants in 2 ms
[2024-05-21 15:11:05] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/55 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/88 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/92 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/95 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 85/180 variables, 95/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 21/201 variables, 21/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/201 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Int declared 45/201 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 7/28 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/116 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 1211 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-21 15:11:07] [INFO ] Invariant cache hit.
[2024-05-21 15:11:07] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 15:11:07] [INFO ] Invariant cache hit.
[2024-05-21 15:11:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:11:07] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [14, 15, 16, 27, 29, 31, 66, 72, 74, 100, 102, 108]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 257 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/116 places, 85/85 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 102 transition count 83
Applied a total of 4 rules in 4 ms. Remains 102 /104 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 102 cols
[2024-05-21 15:11:07] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 15:11:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 15:11:07] [INFO ] Invariant cache hit.
[2024-05-21 15:11:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:11:07] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/116 places, 83/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 496 ms. Remains : 102/116 places, 83/85 transitions.
Computed a total of 57 stabilizing places and 56 stable transitions
Computed a total of 57 stabilizing places and 56 stable transitions
Detected a total of 57/102 stabilizing places and 56/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 724 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3724 resets) in 160 ms. (248 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (851 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-21 15:11:08] [INFO ] Invariant cache hit.
[2024-05-21 15:11:08] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/48 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/66 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/70 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/75 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 81/156 variables, 75/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 29/185 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/185 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 39/185 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 5/22 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/102 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 1295 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9344 reset in 194 ms.
Product exploration explored 100000 steps with 9293 reset in 198 ms.
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-21 15:11:10] [INFO ] Invariant cache hit.
[2024-05-21 15:11:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 15:11:10] [INFO ] Invariant cache hit.
[2024-05-21 15:11:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:11:11] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 15:11:11] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-21 15:11:11] [INFO ] Invariant cache hit.
[2024-05-21 15:11:11] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:11:11] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:11:12] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 8 (OVERLAPS) 83/185 variables, 102/157 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 4/161 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:13] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:11:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:11:13] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 3/164 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:11:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:11:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:14] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:11:14] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:14] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:11:14] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 7/171 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/171 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/171 constraints. Problems are: Problem set: 9 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 171 constraints, problems are : Problem set: 9 solved, 69 unsolved in 4074 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 9 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 12/12 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/19 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 10/29 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/33 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/65 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:11:15] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/85 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:11:16] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:11:17] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:11:17] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:11:17] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 20/105 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 83/185 variables, 102/207 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 4/211 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 69/280 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:11:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:11:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:11:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 4/284 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:19] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:11:19] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:11:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 3/287 constraints. Problems are: Problem set: 9 solved, 69 unsolved
[2024-05-21 15:11:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 1/288 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/288 constraints. Problems are: Problem set: 9 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/288 constraints. Problems are: Problem set: 9 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 288 constraints, problems are : Problem set: 9 solved, 69 unsolved in 8820 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 69/78 constraints, Known Traps: 80/80 constraints]
After SMT, in 12923ms problems are : Problem set: 9 solved, 69 unsolved
Search for dead transitions found 9 dead transitions in 12924ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/102 places, 74/83 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 3 ms. Remains 101 /102 variables (removed 1) and now considering 74/74 (removed 0) transitions.
[2024-05-21 15:11:23] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 13152 ms. Remains : 101/102 places, 74/83 transitions.
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 20939 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(G(p0))&&F(p1))))'
[2024-05-21 15:11:24] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:11:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:11:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 265 transitions and 811 arcs took 5 ms.
Total runtime 116857 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 317
TRANSITIONS: 265
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.001s]


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


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

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

Process ID: 2976
MODEL NAME: /home/mcc/execution/415/model
317 places, 265 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-07-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-07-LTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716304995234

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398300500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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