Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K 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 41K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716333896057

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:24:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:24:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:24:57] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 23:24:57] [INFO ] Transformed 376 places.
[2024-05-21 23:24:57] [INFO ] Transformed 297 transitions.
[2024-05-21 23:24:57] [INFO ] Found NUPN structural information;
[2024-05-21 23:24:57] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 337 transition count 260
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 337 transition count 260
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 321 transition count 244
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 321 transition count 244
Applied a total of 106 rules in 79 ms. Remains 321 /375 variables (removed 54) and now considering 244/296 (removed 52) transitions.
// Phase 1: matrix 244 rows 321 cols
[2024-05-21 23:24:58] [INFO ] Computed 79 invariants in 29 ms
[2024-05-21 23:24:58] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-21 23:24:58] [INFO ] Invariant cache hit.
[2024-05-21 23:24:58] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-21 23:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 32 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 2 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 2 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 3 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 19/158 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 14 (OVERLAPS) 244/565 variables, 321/494 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 14 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 16/510 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 510 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 110/189 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/565 variables, 321/510 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 243/753 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 8/761 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 765 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 122/122 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 321/375 places, 244/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60946 ms. Remains : 321/375 places, 244/296 transitions.
Support contains 41 out of 321 places after structural reductions.
[2024-05-21 23:25:59] [INFO ] Flatten gal took : 105 ms
[2024-05-21 23:25:59] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:25:59] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 40 out of 321 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (413 resets) in 1475 ms. (27 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (64 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2024-05-21 23:26:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/191 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 15 places in 974 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 16 places in 965 ms of which 2 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/304 variables, 45/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 227/531 variables, 304/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/557 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/565 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2880 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/191 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/304 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 227/531 variables, 304/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/557 variables, 12/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/565 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/565 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/565 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 3498ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 151 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 11 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 314 stabilizing places and 235 stable transitions
Graph (complete) has 632 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(p1||X(p2)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 18 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:26:04] [INFO ] Computed 79 invariants in 7 ms
[2024-05-21 23:26:04] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-21 23:26:04] [INFO ] Invariant cache hit.
[2024-05-21 23:26:04] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:26:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:20] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 24441 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 3 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 54514ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 54518ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55109 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 1073 reset in 252 ms.
Product exploration explored 100000 steps with 1072 reset in 271 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 568 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8523 steps (87 resets) in 25 ms. (327 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 12 factoid took 721 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 131 edges and 309 vertex of which 6 / 309 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 611 edges and 304 vertex of which 303 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 302 transition count 198
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 276 transition count 198
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 54 place count 276 transition count 133
Deduced a syphon composed of 65 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 194 place count 201 transition count 133
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 355 place count 120 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 356 place count 119 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 118 transition count 52
Applied a total of 357 rules in 80 ms. Remains 118 /309 variables (removed 191) and now considering 52/232 (removed 180) transitions.
// Phase 1: matrix 52 rows 118 cols
[2024-05-21 23:27:01] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 23:27:01] [INFO ] Implicit Places using invariants in 79 ms returned [110, 112, 114]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/309 places, 52/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 115/309 places, 52/232 transitions.
Computed a total of 115 stabilizing places and 51 stable transitions
Computed a total of 115 stabilizing places and 51 stable transitions
Detected a total of 115/115 stabilizing places and 51/52 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 : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1291 steps (230 resets) in 17 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15805 reset in 222 ms.
Product exploration explored 100000 steps with 15965 reset in 212 ms.
Built C files in :
/tmp/ltsmin97476005516027794
[2024-05-21 23:27:02] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-21 23:27:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:27:02] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-21 23:27:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:27:02] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-21 23:27:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:27:02] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin97476005516027794
Running compilation step : cd /tmp/ltsmin97476005516027794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 344 ms.
Running link step : cd /tmp/ltsmin97476005516027794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin97476005516027794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13292278692555606026.hoa' '--buchi-type=spotba'
LTSmin run took 1228 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 60487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p1 U (p2||G(p1)))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 16 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:27:04] [INFO ] Computed 79 invariants in 5 ms
[2024-05-21 23:27:04] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-21 23:27:04] [INFO ] Invariant cache hit.
[2024-05-21 23:27:05] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (OVERLAPS) 234/545 variables, 311/459 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 5 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 479 constraints, problems are : Problem set: 0 solved, 233 unsolved in 25969 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 89/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 234/545 variables, 311/482 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 233/715 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 15/730 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 732 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 109/109 constraints]
After SMT, in 56052ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 56055ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56731 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 1041 reset in 350 ms.
Product exploration explored 100000 steps with 1038 reset in 217 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 271 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (416 resets) in 458 ms. (87 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-05-21 23:28:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/188 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/301 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 225/526 variables, 301/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/542 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 545/545 variables, and 399 constraints, problems are : Problem set: 1 solved, 0 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 594ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1))))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F p0), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 26 factoid took 1047 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 309 transition count 205
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 282 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 280 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 59 place count 280 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 381 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 108 transition count 49
Applied a total of 384 rules in 45 ms. Remains 108 /311 variables (removed 203) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-05-21 23:28:04] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:28:04] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:28:04] [INFO ] Invariant cache hit.
[2024-05-21 23:28:04] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 319 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/311 places, 49/234 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
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 44 place count 44 transition count 30
Applied a total of 44 rules in 8 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2024-05-21 23:28:04] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 23:28:05] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 23:28:05] [INFO ] Invariant cache hit.
[2024-05-21 23:28:05] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/311 places, 30/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 698 ms. Remains : 44/311 places, 30/234 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 416 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 7038 steps (1142 resets) in 31 ms. (219 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 17 factoid took 997 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16107 reset in 138 ms.
Product exploration explored 100000 steps with 15794 reset in 147 ms.
Built C files in :
/tmp/ltsmin12249875201341490114
[2024-05-21 23:28:07] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2024-05-21 23:28:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:28:07] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2024-05-21 23:28:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:28:07] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2024-05-21 23:28:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:28:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12249875201341490114
Running compilation step : cd /tmp/ltsmin12249875201341490114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin12249875201341490114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12249875201341490114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3530399378511480092.hoa' '--buchi-type=spotba'
LTSmin run took 1672 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 64886 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 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 10 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:28:09] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 23:28:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 23:28:09] [INFO ] Invariant cache hit.
[2024-05-21 23:28:09] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:18] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:27] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 1 ms to minimize.
[2024-05-21 23:28:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:28:27] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 23462 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:54] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
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 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(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 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 53495ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 53498ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53880 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 36 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-04 finished in 54269 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((F(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 140 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 314 transition count 204
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 206 transition count 138
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 198 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 198 transition count 130
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 392 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 108 transition count 49
Applied a total of 394 rules in 55 ms. Remains 108 /321 variables (removed 213) and now considering 49/244 (removed 195) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-05-21 23:29:03] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:29:03] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 23:29:03] [INFO ] Invariant cache hit.
[2024-05-21 23:29:03] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 254 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/321 places, 49/244 transitions.
Graph (complete) has 141 edges and 69 vertex of which 61 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 51 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 36 transition count 30
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 46 place count 35 transition count 29
Applied a total of 46 rules in 4 ms. Remains 35 /69 variables (removed 34) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-05-21 23:29:04] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 23:29:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 23:29:04] [INFO ] Invariant cache hit.
[2024-05-21 23:29:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/321 places, 29/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 399 ms. Remains : 35/321 places, 29/244 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-06
Product exploration explored 100000 steps with 31751 reset in 63 ms.
Product exploration explored 100000 steps with 31636 reset in 65 ms.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13587 steps (5170 resets) in 17 ms. (754 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-21 23:29:05] [INFO ] Invariant cache hit.
[2024-05-21 23:29:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 23:29:05] [INFO ] Invariant cache hit.
[2024-05-21 23:29:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-21 23:29:05] [INFO ] Redundant transitions in 22 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-21 23:29:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 212 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 28/62 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 238 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 35/35 places, 29/29 transitions.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT 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 11 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1818 steps (673 resets) in 35 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 555 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31809 reset in 84 ms.
Product exploration explored 100000 steps with 31930 reset in 93 ms.
Built C files in :
/tmp/ltsmin3302715216597388189
[2024-05-21 23:29:07] [INFO ] Computing symmetric may disable matrix : 29 transitions.
[2024-05-21 23:29:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:07] [INFO ] Computing symmetric may enable matrix : 29 transitions.
[2024-05-21 23:29:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:07] [INFO ] Computing Do-Not-Accords matrix : 29 transitions.
[2024-05-21 23:29:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3302715216597388189
Running compilation step : cd /tmp/ltsmin3302715216597388189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin3302715216597388189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3302715216597388189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4576427063826547234.hoa' '--buchi-type=spotba'
LTSmin run took 1416 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-06 finished in 5291 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 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 314 transition count 203
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 281 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 70 place count 280 transition count 136
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 212 place count 204 transition count 136
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 221 place count 195 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 230 place count 195 transition count 127
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 20 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-21 23:29:08] [INFO ] Computed 60 invariants in 0 ms
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:29:09] [INFO ] Invariant cache hit.
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 226 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 34 transition count 28
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 44 place count 33 transition count 27
Applied a total of 44 rules in 4 ms. Remains 33 /66 variables (removed 33) and now considering 27/46 (removed 19) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-21 23:29:09] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 23:29:09] [INFO ] Invariant cache hit.
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/321 places, 27/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 33/321 places, 27/244 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-07
Stuttering criterion allowed to conclude after 96 steps with 29 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-07 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 8 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:29:09] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 23:29:09] [INFO ] Invariant cache hit.
[2024-05-21 23:29:09] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:28] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:29:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 26579 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 56646ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 56649ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57166 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-08 finished in 57275 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 (G(p1)||X((p2||X(((p3||F(!p2)) U (p2&&(p3||F(!p2)))))))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 11 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
[2024-05-21 23:30:06] [INFO ] Invariant cache hit.
[2024-05-21 23:30:06] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 23:30:06] [INFO ] Invariant cache hit.
[2024-05-21 23:30:07] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:30:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 7 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 24812 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:30:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:40] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 54866ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 54869ms
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55384 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09
Product exploration explored 100000 steps with 33290 reset in 167 ms.
Product exploration explored 100000 steps with 33291 reset in 173 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1600 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (409 resets) in 465 ms. (85 steps per ms) remains 1/18 properties
BEST_FIRST walk for 15564 steps (25 resets) in 23 ms. (648 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p3), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 27 factoid took 6983 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-21 23:31:12] [INFO ] Invariant cache hit.
[2024-05-21 23:31:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:31:12] [INFO ] Invariant cache hit.
[2024-05-21 23:31:13] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:31:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 24018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 54067ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 54069ms
Finished structural reductions in LTL mode , in 1 iterations and 54618 ms. Remains : 309/309 places, 232/232 transitions.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1230 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (409 resets) in 351 ms. (113 steps per ms) remains 3/18 properties
BEST_FIRST walk for 24125 steps (41 resets) in 59 ms. (402 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p3), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 27 factoid took 8389 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 33347 reset in 199 ms.
Product exploration explored 100000 steps with 33396 reset in 211 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 130 edges and 309 vertex of which 6 / 309 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 611 edges and 304 vertex of which 303 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
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 303 transition count 225
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 303 transition count 249
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 303 transition count 249
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 292 transition count 228
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 292 transition count 228
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 195 place count 292 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 210 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 225 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Applied a total of 225 rules in 61 ms. Remains 277 /309 variables (removed 32) and now considering 213/232 (removed 19) transitions.
[2024-05-21 23:32:20] [INFO ] Redundant transitions in 266 ms returned []
Running 212 sub problems to find dead transitions.
// Phase 1: matrix 213 rows 277 cols
[2024-05-21 23:32:20] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:32:20] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/99 constraints. Problems are: Problem set: 70 solved, 142 unsolved
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 20/119 constraints. Problems are: Problem set: 125 solved, 87 unsolved
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 20/139 constraints. Problems are: Problem set: 142 solved, 70 unsolved
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 7/146 constraints. Problems are: Problem set: 148 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/146 constraints. Problems are: Problem set: 148 solved, 64 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 9 (OVERLAPS) 212/489 variables, 277/423 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 13/436 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/436 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 1/490 variables, 1/437 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 1/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/490 variables, 0/438 constraints. Problems are: Problem set: 159 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 438 constraints, problems are : Problem set: 159 solved, 53 unsolved in 9986 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 277/277 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 159 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 108/239 variables, 40/40 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 68/108 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 5/113 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/113 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 36/275 variables, 39/152 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/154 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/154 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 212/487 variables, 275/429 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 13/442 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 53/495 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/495 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 2/489 variables, 2/497 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 0/497 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 1/490 variables, 1/498 constraints. Problems are: Problem set: 159 solved, 53 unsolved
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 4/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 0/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
At refinement iteration 17 (OVERLAPS) 0/490 variables, 0/502 constraints. Problems are: Problem set: 159 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 502 constraints, problems are : Problem set: 159 solved, 53 unsolved in 10466 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 277/277 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 53/212 constraints, Known Traps: 79/79 constraints]
After SMT, in 20581ms problems are : Problem set: 159 solved, 53 unsolved
Search for dead transitions found 159 dead transitions in 20585ms
Found 159 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 159 transitions
Dead transitions reduction (with SMT) removed 159 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 277/309 places, 54/232 transitions.
Graph (complete) has 538 edges and 277 vertex of which 132 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.1 ms
Discarding 145 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Applied a total of 1 rules in 13 ms. Remains 120 /277 variables (removed 157) and now considering 54/54 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/309 places, 54/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20938 ms. Remains : 120/309 places, 54/232 transitions.
Built C files in :
/tmp/ltsmin4323659414054316122
[2024-05-21 23:32:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4323659414054316122
Running compilation step : cd /tmp/ltsmin4323659414054316122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin4323659414054316122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4323659414054316122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5730536473560687584.hoa' '--buchi-type=spotba'
LTSmin run took 210 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 155052 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 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 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 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 196 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 196 transition count 128
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 25 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-21 23:32:41] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:32:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 23:32:41] [INFO ] Invariant cache hit.
[2024-05-21 23:32:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 282 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
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 46 place count 32 transition count 26
Applied a total of 46 rules in 5 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-05-21 23:32:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 23:32:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 23:32:42] [INFO ] Invariant cache hit.
[2024-05-21 23:32:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 382 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-10
Stuttering criterion allowed to conclude after 850 steps with 268 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-10 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 310 transition count 233
Applied a total of 22 rules in 18 ms. Remains 310 /321 variables (removed 11) and now considering 233/244 (removed 11) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:32:42] [INFO ] Computed 79 invariants in 8 ms
[2024-05-21 23:32:42] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 23:32:42] [INFO ] Invariant cache hit.
[2024-05-21 23:32:42] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:32:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 16 (OVERLAPS) 233/543 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 486 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 97/176 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/486 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/718 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 8/726 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 732 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 111/111 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 310/321 places, 233/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 310/321 places, 233/244 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 1021 reset in 224 ms.
Product exploration explored 100000 steps with 1033 reset in 249 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 377 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 9 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 19 to 14
RANDOM walk for 40000 steps (407 resets) in 344 ms. (115 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40003 steps (68 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (74 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (75 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (75 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
[2024-05-21 23:33:44] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 189/211 variables, 39/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 88/299 variables, 39/83 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 221/520 variables, 299/383 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/383 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/536 variables, 7/390 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/390 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 543/543 variables, and 394 constraints, problems are : Problem set: 5 solved, 0 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 414ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p0 p2)), (G (OR p0 p2)), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p1 p2)), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 34 factoid took 1508 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-21 23:33:47] [INFO ] Invariant cache hit.
[2024-05-21 23:33:47] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:33:47] [INFO ] Invariant cache hit.
[2024-05-21 23:33:47] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 3 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 16 (OVERLAPS) 233/543 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 494 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 233/543 variables, 310/495 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 232/727 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:26] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 8/735 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 739 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 118/118 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 310/310 places, 233/233 transitions.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 863 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 11777 steps (116 resets) in 83 ms. (140 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1 p2))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 2145 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 296 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 294 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1010 reset in 235 ms.
Product exploration explored 100000 steps with 1023 reset in 241 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 351 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Graph (trivial) has 129 edges and 310 vertex of which 6 / 310 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 612 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 304 transition count 226
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 304 transition count 249
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 304 transition count 249
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 294 transition count 230
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 294 transition count 230
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 198 place count 294 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 214 place count 278 transition count 214
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 230 place count 278 transition count 214
Deduced a syphon composed of 150 places in 0 ms
Applied a total of 230 rules in 42 ms. Remains 278 /310 variables (removed 32) and now considering 214/233 (removed 19) transitions.
[2024-05-21 23:34:52] [INFO ] Redundant transitions in 59 ms returned []
Running 213 sub problems to find dead transitions.
// Phase 1: matrix 214 rows 278 cols
[2024-05-21 23:34:53] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:34:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 40/71 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 20/99 constraints. Problems are: Problem set: 89 solved, 124 unsolved
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 20/119 constraints. Problems are: Problem set: 130 solved, 83 unsolved
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 17/136 constraints. Problems are: Problem set: 153 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/136 constraints. Problems are: Problem set: 153 solved, 60 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 8 (OVERLAPS) 213/491 variables, 278/414 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 13/427 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/427 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 1/492 variables, 1/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 13 (OVERLAPS) 0/492 variables, 0/428 constraints. Problems are: Problem set: 164 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 428 constraints, problems are : Problem set: 164 solved, 49 unsolved in 7807 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 278/278 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 164 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 112/239 variables, 40/40 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/41 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 57/98 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/98 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 37/276 variables, 38/136 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/136 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 213/489 variables, 276/412 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 13/425 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 49/474 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/474 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 2/491 variables, 2/476 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 0/476 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 13 (OVERLAPS) 1/492 variables, 1/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 0/492 variables, 0/477 constraints. Problems are: Problem set: 164 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 477 constraints, problems are : Problem set: 164 solved, 49 unsolved in 5814 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 278/278 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 49/213 constraints, Known Traps: 57/57 constraints]
After SMT, in 13730ms problems are : Problem set: 164 solved, 49 unsolved
Search for dead transitions found 164 dead transitions in 13735ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 278/310 places, 50/233 transitions.
Graph (complete) has 544 edges and 278 vertex of which 128 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.1 ms
Discarding 150 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Applied a total of 1 rules in 8 ms. Remains 112 /278 variables (removed 166) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/310 places, 50/233 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13853 ms. Remains : 112/310 places, 50/233 transitions.
Built C files in :
/tmp/ltsmin5400238822760143332
[2024-05-21 23:35:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5400238822760143332
Running compilation step : cd /tmp/ltsmin5400238822760143332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin5400238822760143332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5400238822760143332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased752104010633373862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 11 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:35:21] [INFO ] Computed 79 invariants in 11 ms
[2024-05-21 23:35:22] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 23:35:22] [INFO ] Invariant cache hit.
[2024-05-21 23:35:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:35:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 14 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 16 (OVERLAPS) 233/543 variables, 310/483 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 11/494 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 494 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 233/543 variables, 310/495 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 232/727 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 8/735 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 739 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 118/118 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 310/310 places, 233/233 transitions.
Built C files in :
/tmp/ltsmin17131018869268744809
[2024-05-21 23:36:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17131018869268744809
Running compilation step : cd /tmp/ltsmin17131018869268744809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 443 ms.
Running link step : cd /tmp/ltsmin17131018869268744809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17131018869268744809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11376191979633895046.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:36:37] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:36:37] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:36:37] [INFO ] Time to serialize gal into /tmp/LTL11193836688017371754.gal : 5 ms
[2024-05-21 23:36:37] [INFO ] Time to serialize properties into /tmp/LTL815309923314862956.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11193836688017371754.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8525147199964875553.hoa' '-atoms' '/tmp/LTL815309923314862956.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL815309923314862956.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8525147199964875553.hoa
Detected timeout of ITS tools.
[2024-05-21 23:36:52] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:36:52] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:36:52] [INFO ] Time to serialize gal into /tmp/LTL15667199277184163249.gal : 4 ms
[2024-05-21 23:36:52] [INFO ] Time to serialize properties into /tmp/LTL5490425066500207823.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15667199277184163249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5490425066500207823.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(p37!=1)")U((G("(p37!=1)"))||(("((p37!=1)&&(p291!=1))")&&(X((F("(p37!=1)"))&&(X(G("(p332!=1)")))))))))
Formula 0 simplified : !"(p37!=1)" M (!"((p37!=1)&&(p291!=1))" | X(G!"(p37!=1)" | XF!"(p332!=1)"))
Detected timeout of ITS tools.
[2024-05-21 23:37:07] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:37:07] [INFO ] Applying decomposition
[2024-05-21 23:37:07] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12866990136896681951.txt' '-o' '/tmp/graph12866990136896681951.bin' '-w' '/tmp/graph12866990136896681951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12866990136896681951.bin' '-l' '-1' '-v' '-w' '/tmp/graph12866990136896681951.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:08] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:37:08] [INFO ] Flatten gal took : 128 ms
[2024-05-21 23:37:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 23:37:08] [INFO ] Time to serialize gal into /tmp/LTL8112615504319882928.gal : 8 ms
[2024-05-21 23:37:08] [INFO ] Time to serialize properties into /tmp/LTL4505563812139844507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8112615504319882928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4505563812139844507.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("(u13.p37!=1)")U((G("(u13.p37!=1)"))||(("((u13.p37!=1)&&(i2.u92.p291!=1))")&&(X((F("(u13.p37!=1)"))&&(X(G("(i9.u89.p332!=1)"))))))...158
Formula 0 simplified : !"(u13.p37!=1)" M (!"((u13.p37!=1)&&(i2.u92.p291!=1))" | X(G!"(u13.p37!=1)" | XF!"(i9.u89.p332!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t165, t173, t177, i0.t161, i0.u18.t168, i0.u20.t164, i1.t169, i1.u12.t180, i1.u16.t172, i2.t1...742
Computing Next relation with stutter on 13133 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 281272 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((G(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 29 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:37:23] [INFO ] Computed 79 invariants in 1 ms
[2024-05-21 23:37:23] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 23:37:23] [INFO ] Invariant cache hit.
[2024-05-21 23:37:23] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:37:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 13 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/483 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 486 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 96/175 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/489 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 233/722 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 14/737 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 737 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 114/114 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 11728 steps with 117 reset in 26 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 61016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&(p1||X(F(!p2)))))) U (G(p0)||(p3&&(p0 U (G(p0)||(p0&&(p1||X(F(!p2))))))&&X((p3 U (!p2||G(p3))))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 30 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:38:24] [INFO ] Computed 79 invariants in 3 ms
[2024-05-21 23:38:24] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:38:24] [INFO ] Invariant cache hit.
[2024-05-21 23:38:24] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 4 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 24 places in 1113 ms of which 1 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 234/545 variables, 311/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 468 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/473 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 233/706 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 6/712 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 6/718 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 720 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 97/97 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 352 ms :[true, p2, (NOT p0), (AND (NOT p0) p2), (AND (NOT p3) p2), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p2)), (X p3), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 p3 p1 p2))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (AND p0 p3 p1)), (X p1), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 p3 p1))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 1179 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-13 finished in 62565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 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 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 218 place count 197 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 226 place count 197 transition count 129
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 45 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-21 23:39:27] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:39:27] [INFO ] Invariant cache hit.
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 68, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 366 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 138 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 44 place count 33 transition count 27
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 46 place count 32 transition count 26
Applied a total of 46 rules in 6 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-05-21 23:39:27] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 23:39:27] [INFO ] Invariant cache hit.
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 510 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 585 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((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 22 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:39:27] [INFO ] Computed 79 invariants in 3 ms
[2024-05-21 23:39:27] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 23:39:27] [INFO ] Invariant cache hit.
[2024-05-21 23:39:28] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:39:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 4 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 13/141 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/465 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 467 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 234/545 variables, 311/467 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 233/700 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 12/712 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 715 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 92/92 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 1031 reset in 233 ms.
Product exploration explored 100000 steps with 1027 reset in 245 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13426 steps (134 resets) in 49 ms. (268 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 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 309 transition count 207
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 284 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 282 transition count 205
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 55 place count 282 transition count 138
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 370 place count 118 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 118 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 117 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 116 transition count 52
Applied a total of 373 rules in 33 ms. Remains 116 /311 variables (removed 195) and now considering 52/234 (removed 182) transitions.
// Phase 1: matrix 52 rows 116 cols
[2024-05-21 23:40:30] [INFO ] Computed 65 invariants in 4 ms
[2024-05-21 23:40:30] [INFO ] Implicit Places using invariants in 107 ms returned [100, 102, 104, 106, 108]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 108 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/311 places, 52/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 111/311 places, 52/234 transitions.
Computed a total of 108 stabilizing places and 48 stable transitions
Computed a total of 108 stabilizing places and 48 stable transitions
Detected a total of 108/111 stabilizing places and 48/52 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 : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3681 steps (505 resets) in 18 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14650 reset in 245 ms.
Product exploration explored 100000 steps with 14562 reset in 256 ms.
Built C files in :
/tmp/ltsmin3720597331004759841
[2024-05-21 23:40:31] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-21 23:40:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:31] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-21 23:40:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:31] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-21 23:40:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3720597331004759841
Running compilation step : cd /tmp/ltsmin3720597331004759841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 240 ms.
Running link step : cd /tmp/ltsmin3720597331004759841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3720597331004759841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4494191545502432015.hoa' '--buchi-type=spotba'
LTSmin run took 732 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 64980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
[2024-05-21 23:40:32] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11696249917934954387
[2024-05-21 23:40:32] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2024-05-21 23:40:32] [INFO ] Applying decomposition
[2024-05-21 23:40:32] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:32] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2024-05-21 23:40:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:32] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:40:32] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2024-05-21 23:40:32] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:32] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11696249917934954387
Running compilation step : cd /tmp/ltsmin11696249917934954387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18350232571899702514.txt' '-o' '/tmp/graph18350232571899702514.bin' '-w' '/tmp/graph18350232571899702514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18350232571899702514.bin' '-l' '-1' '-v' '-w' '/tmp/graph18350232571899702514.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:32] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:40:32] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:40:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:40:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3351078924617846577.gal : 5 ms
[2024-05-21 23:40:32] [INFO ] Time to serialize properties into /tmp/LTLFireability2070120816821094449.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3351078924617846577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2070120816821094449.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(i11.u14.p37!=1)")U((G("(i11.u14.p37!=1)"))||(("((i11.u14.p37!=1)&&(i3.u98.p291!=1))")&&(X((F("(i11.u14.p37!=1)"))&&(X(G("(i17.u1...176
Formula 0 simplified : !"(i11.u14.p37!=1)" M (!"((i11.u14.p37!=1)&&(i3.u98.p291!=1))" | X(G!"(i11.u14.p37!=1)" | XF!"(i17.u102.p332!=1)"))
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin11696249917934954387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11696249917934954387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t117, t125, t169, t177, i0.i0.u38.t142, i0.i0.u54.t124, i0.i0.u60.t113, i0.i1.u58.t116, i1.t1...855
Computing Next relation with stutter on 13133 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: LTL layer: formula: ((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 0/ 8), 0.007: "((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: buchi has 9 states
pins2lts-mc-linux64( 0/ 8), 0.122: There are 248 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.122: State length is 322, there are 277 groups
pins2lts-mc-linux64( 0/ 8), 0.122: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.122: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.122: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.122: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.200: [Blue] ~87 levels ~960 states ~2816 transitions
pins2lts-mc-linux64( 4/ 8), 0.209: [Blue] ~87 levels ~1920 states ~6096 transitions
pins2lts-mc-linux64( 4/ 8), 0.248: [Blue] ~87 levels ~3840 states ~13984 transitions
pins2lts-mc-linux64( 4/ 8), 0.324: [Blue] ~87 levels ~7680 states ~31856 transitions
pins2lts-mc-linux64( 1/ 8), 0.533: [Blue] ~86 levels ~15360 states ~73680 transitions
pins2lts-mc-linux64( 1/ 8), 0.932: [Blue] ~86 levels ~30720 states ~163288 transitions
pins2lts-mc-linux64( 1/ 8), 1.257: [Blue] ~86 levels ~61440 states ~353056 transitions
pins2lts-mc-linux64( 1/ 8), 1.851: [Blue] ~86 levels ~122880 states ~782160 transitions
pins2lts-mc-linux64( 1/ 8), 2.976: [Blue] ~86 levels ~245760 states ~1708688 transitions
pins2lts-mc-linux64( 2/ 8), 4.881: [Blue] ~87 levels ~491520 states ~2862048 transitions
pins2lts-mc-linux64( 2/ 8), 7.785: [Blue] ~87 levels ~983040 states ~6022952 transitions
pins2lts-mc-linux64( 2/ 8), 13.051: [Blue] ~87 levels ~1966080 states ~13028024 transitions
pins2lts-mc-linux64( 2/ 8), 23.359: [Blue] ~87 levels ~3932160 states ~27262944 transitions
pins2lts-mc-linux64( 2/ 8), 44.760: [Blue] ~87 levels ~7864320 states ~58455992 transitions
pins2lts-mc-linux64( 2/ 8), 90.358: [Blue] ~87 levels ~15728640 states ~124331712 transitions
pins2lts-mc-linux64( 2/ 8), 181.630: [Blue] ~87 levels ~31457280 states ~256864552 transitions
pins2lts-mc-linux64( 2/ 8), 363.565: [Blue] ~87 levels ~62914560 states ~544743392 transitions
pins2lts-mc-linux64( 2/ 8), 797.998: [Blue] ~87 levels ~125829120 states ~1146873992 transitions
pins2lts-mc-linux64( 6/ 8), 991.446: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 991.507:
pins2lts-mc-linux64( 0/ 8), 991.507: Explored 136102497 states 1389235842 transitions, fanout: 10.207
pins2lts-mc-linux64( 0/ 8), 991.507: Total exploration time 991.380 sec (991.300 sec minimum, 991.325 sec on average)
pins2lts-mc-linux64( 0/ 8), 991.507: States per second: 137286, Transitions per second: 1401315
pins2lts-mc-linux64( 0/ 8), 991.507:
pins2lts-mc-linux64( 0/ 8), 991.507: State space has 134217290 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 991.507: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 991.507: blue states: 136102497 (101.40%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 991.507: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 991.507: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 991.507:
pins2lts-mc-linux64( 0/ 8), 991.507: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 991.507:
pins2lts-mc-linux64( 0/ 8), 991.507: Queue width: 8B, total height: 690, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 991.507: Tree memory: 1042.2MB, 8.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 991.507: Tree fill ratio (roots/leafs): 99.0%/7.0%
pins2lts-mc-linux64( 0/ 8), 991.507: Stored 244 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 991.507: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 991.507: Est. total memory use: 1042.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11696249917934954387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11696249917934954387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-22 00:05:41] [INFO ] Applying decomposition
[2024-05-22 00:05:41] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:05:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:05:41] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-22 00:05:41] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-22 00:05:41] [INFO ] Time to serialize gal into /tmp/LTLFireability11796728100447155107.gal : 14 ms
[2024-05-22 00:05:41] [INFO ] Time to serialize properties into /tmp/LTLFireability10890204666038150778.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11796728100447155107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10890204666038150778.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)")U((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)"))||(("((i0.i0.i0.i0.i0....304
Formula 0 simplified : !"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)" M (!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)&&(i1.u118.p291!=1))" | X(...234
ITS-tools command line returned an error code 137
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:12:52] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-22 00:12:52] [INFO ] Transformed 321 places.
[2024-05-22 00:12:52] [INFO ] Transformed 244 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:12:52] [INFO ] Time to serialize gal into /tmp/LTLFireability8219823777020943196.gal : 2 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10222721468163044393.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8219823777020943196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10222721468163044393.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(p37!=1)")U((G("(p37!=1)"))||(("((p37!=1)&&(p291!=1))")&&(X((F("(p37!=1)"))&&(X(G("(p332!=1)")))))))))
Formula 0 simplified : !"(p37!=1)" M (!"((p37!=1)&&(p291!=1))" | X(G!"(p37!=1)" | XF!"(p332!=1)"))
ITS-tools command line returned an error code 137
Total runtime 3575295 ms.

BK_STOP 1716337472940

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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