Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 63K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225040028

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:21] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-01 06:57:21] [INFO ] Transformed 274 places.
[2024-06-01 06:57:21] [INFO ] Transformed 237 transitions.
[2024-06-01 06:57:21] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:21] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 181 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 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 236 transition count 201
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 236 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 236 transition count 200
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 87 place count 222 transition count 186
Iterating global reduction 2 with 14 rules applied. Total rules applied 101 place count 222 transition count 186
Applied a total of 101 rules in 112 ms. Remains 222 /273 variables (removed 51) and now considering 186/236 (removed 50) transitions.
// Phase 1: matrix 186 rows 222 cols
[2024-06-01 06:57:22] [INFO ] Computed 41 invariants in 16 ms
[2024-06-01 06:57:22] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-01 06:57:22] [INFO ] Invariant cache hit.
[2024-06-01 06:57:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-01 06:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 20 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 20 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:25] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 5 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 3 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 186/408 variables, 222/347 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 9/356 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 18 (OVERLAPS) 0/408 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 360 constraints, problems are : Problem set: 0 solved, 185 unsolved in 26399 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 97/138 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/408 variables, 222/362 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 185/547 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/556 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 566 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 118/118 constraints]
After SMT, in 56503ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 56530ms
Starting structural reductions in LTL mode, iteration 1 : 222/273 places, 186/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57241 ms. Remains : 222/273 places, 186/236 transitions.
Support contains 39 out of 222 places after structural reductions.
[2024-06-01 06:58:19] [INFO ] Flatten gal took : 57 ms
[2024-06-01 06:58:19] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:58:19] [INFO ] Input system was already deterministic with 186 transitions.
RANDOM walk for 40000 steps (476 resets) in 2043 ms. (19 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40002 steps (89 resets) in 152 ms. (261 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2024-06-01 06:58:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 151/203 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 166/369 variables, 203/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 9 (OVERLAPS) 28/397 variables, 11/261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 5/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/406 variables, 7/273 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/408 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 274 constraints, problems are : Problem set: 1 solved, 1 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/203 variables, 40/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 8/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/369 variables, 203/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/397 variables, 11/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 3/269 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/406 variables, 7/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/408 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/408 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 277 constraints, problems are : Problem set: 1 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1106ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 128 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 5 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-03-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 215 stabilizing places and 177 stable transitions
Graph (complete) has 463 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 120 edges and 222 vertex of which 7 / 222 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 455 edges and 216 vertex of which 215 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 214 transition count 148
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 185 transition count 148
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 60 place count 185 transition count 106
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 154 place count 133 transition count 106
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 165 place count 122 transition count 95
Iterating global reduction 2 with 11 rules applied. Total rules applied 176 place count 122 transition count 95
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 293 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 61 transition count 36
Applied a total of 295 rules in 51 ms. Remains 61 /222 variables (removed 161) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 61 cols
[2024-06-01 06:58:21] [INFO ] Computed 29 invariants in 0 ms
[2024-06-01 06:58:21] [INFO ] Implicit Places using invariants in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/222 places, 36/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 60/222 places, 36/186 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 22197 reset in 205 ms.
Product exploration explored 100000 steps with 22191 reset in 158 ms.
Computed a total of 60 stabilizing places and 35 stable transitions
Computed a total of 60 stabilizing places and 35 stable transitions
Detected a total of 60/60 stabilizing places and 35/36 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 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 23904 steps (6889 resets) in 107 ms. (221 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 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-06-01 06:58:22] [INFO ] Computed 28 invariants in 0 ms
[2024-06-01 06:58:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 06:58:22] [INFO ] Invariant cache hit.
[2024-06-01 06:58:22] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 145 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/60 places, 36/36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 32 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 25 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 23 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 23 transition count 27
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 22 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 28 place count 18 transition count 22
Applied a total of 28 rules in 3 ms. Remains 18 /32 variables (removed 14) and now considering 22/36 (removed 14) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-06-01 06:58:22] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:58:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 06:58:22] [INFO ] Invariant cache hit.
[2024-06-01 06:58:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/60 places, 22/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 270 ms. Remains : 18/60 places, 22/36 transitions.
Computed a total of 18 stabilizing places and 21 stable transitions
Computed a total of 18 stabilizing places and 21 stable transitions
Detected a total of 18/18 stabilizing places and 21/22 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 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 30423 steps (9937 resets) in 52 ms. (574 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 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24739 reset in 47 ms.
Product exploration explored 100000 steps with 24739 reset in 136 ms.
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 06:58:23] [INFO ] Invariant cache hit.
[2024-06-01 06:58:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 06:58:23] [INFO ] Invariant cache hit.
[2024-06-01 06:58:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 06:58:23] [INFO ] Redundant transitions in 21 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 06:58:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/38 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 18 constraints, problems are : Problem set: 0 solved, 19 unsolved in 113 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/38 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 37 constraints, problems are : Problem set: 0 solved, 19 unsolved in 129 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 18/18 places, 22/22 transitions.
Treatment of property BusinessProcesses-PT-03-LTLFireability-01 finished in 2167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(F(p0))&&F(p1)))))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 208 transition count 172
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 208 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 202 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 202 transition count 166
Applied a total of 40 rules in 7 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-06-01 06:58:23] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 06:58:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 06:58:24] [INFO ] Invariant cache hit.
[2024-06-01 06:58:24] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 06:58:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 6 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10077 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 4 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 40116ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40118ms
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40428 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 1788 reset in 152 ms.
Stack based approach found an accepted trace after 318 steps with 6 reset with depth 17 and stack size 17 in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-02 finished in 40909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(X(p3)&&p2)))))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 175
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 206 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 206 transition count 170
Applied a total of 32 rules in 8 ms. Remains 206 /222 variables (removed 16) and now considering 170/186 (removed 16) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-06-01 06:59:04] [INFO ] Computed 41 invariants in 8 ms
[2024-06-01 06:59:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 06:59:04] [INFO ] Invariant cache hit.
[2024-06-01 06:59:05] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-01 06:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/376 variables, 206/293 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/376 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 14 (OVERLAPS) 0/376 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 311 constraints, problems are : Problem set: 0 solved, 169 unsolved in 16930 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/376 variables, 206/320 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 169/489 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 516 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 100/100 constraints]
After SMT, in 46962ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 46964ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 170/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47271 ms. Remains : 206/222 places, 170/186 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-03
Product exploration explored 100000 steps with 33382 reset in 149 ms.
Product exploration explored 100000 steps with 33448 reset in 127 ms.
Computed a total of 200 stabilizing places and 162 stable transitions
Graph (complete) has 435 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 200 stabilizing places and 162 stable transitions
Detected a total of 200/206 stabilizing places and 162/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X p3), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1862 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), false, false]
RANDOM walk for 40000 steps (469 resets) in 531 ms. (75 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40003 steps (85 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (95 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2024-06-01 06:59:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 157/196 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 160/356 variables, 196/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 7 (OVERLAPS) 15/371 variables, 7/244 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/376 variables, 3/247 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 247 constraints, problems are : Problem set: 2 solved, 2 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 157/196 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/47 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 160/356 variables, 196/243 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 9/252 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf8 is UNSAT
At refinement iteration 9 (OVERLAPS) 15/371 variables, 7/259 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 3/263 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/263 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/376 variables, 3/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/376 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 266 constraints, problems are : Problem set: 3 solved, 1 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 995ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 170/170 transitions.
Graph (trivial) has 102 edges and 206 vertex of which 6 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 423 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 200 transition count 137
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 176 transition count 137
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 50 place count 176 transition count 97
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 140 place count 126 transition count 97
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 261 place count 65 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 64 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 63 transition count 36
Applied a total of 263 rules in 18 ms. Remains 63 /206 variables (removed 143) and now considering 36/170 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/206 places, 36/170 transitions.
RANDOM walk for 40000 steps (1766 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 830 steps (28 resets) in 6 ms. (118 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X p3), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p1 p2 p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p0)]
Knowledge based reduction with 32 factoid took 6033 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 170/170 transitions.
Graph (trivial) has 100 edges and 206 vertex of which 6 / 206 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 428 edges and 201 vertex of which 200 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 199 transition count 139
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 176 transition count 139
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 48 place count 176 transition count 100
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 135 place count 128 transition count 100
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 254 place count 68 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 67 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 66 transition count 40
Applied a total of 256 rules in 23 ms. Remains 66 /206 variables (removed 140) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 66 cols
[2024-06-01 07:00:02] [INFO ] Computed 30 invariants in 1 ms
[2024-06-01 07:00:02] [INFO ] Implicit Places using invariants in 50 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/206 places, 40/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 64/206 places, 40/170 transitions.
Computed a total of 64 stabilizing places and 39 stable transitions
Computed a total of 64 stabilizing places and 39 stable transitions
Detected a total of 64/64 stabilizing places and 39/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1316 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
RANDOM walk for 40000 steps (11407 resets) in 173 ms. (229 steps per ms) remains 1/12 properties
BEST_FIRST walk for 36370 steps (4733 resets) in 36 ms. (982 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1)]
Knowledge based reduction with 26 factoid took 4588 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Product exploration explored 100000 steps with 39869 reset in 243 ms.
Product exploration explored 100000 steps with 39792 reset in 193 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 64 cols
[2024-06-01 07:00:10] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 07:00:10] [INFO ] Invariant cache hit.
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [0, 1, 2, 5, 6, 7, 8, 9, 10, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 40, 41, 43, 45, 47, 49]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 160 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/64 places, 40/40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 30 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 29 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 27 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 27 transition count 31
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 27 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 26 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 25 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 25 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 30 place count 21 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 21 transition count 24
Applied a total of 31 rules in 5 ms. Remains 21 /36 variables (removed 15) and now considering 24/40 (removed 16) transitions.
// Phase 1: matrix 24 rows 21 cols
[2024-06-01 07:00:10] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:00:10] [INFO ] Invariant cache hit.
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/64 places, 24/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 21/64 places, 24/40 transitions.
Treatment of property BusinessProcesses-PT-03-LTLFireability-03 finished in 65456 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 U (p1||X(!p2))))))'
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 10 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-06-01 07:00:10] [INFO ] Computed 41 invariants in 1 ms
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 07:00:10] [INFO ] Invariant cache hit.
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:00:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 51 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/279 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 10/289 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 289 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10730 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 44/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/289 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/456 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:00:24] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 32 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 13/469 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:33] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 50 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/372 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 479 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 67/67 constraints]
After SMT, in 40763ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 40766ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41228 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-05
Product exploration explored 100000 steps with 1194 reset in 187 ms.
Product exploration explored 100000 steps with 1198 reset in 279 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 433 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 264 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
RANDOM walk for 40000 steps (473 resets) in 170 ms. (233 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (75 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (87 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (76 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
[2024-06-01 07:00:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/195 variables, 36/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 161/356 variables, 195/239 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:00:53] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/242 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 370/372 variables, and 250 constraints, problems are : Problem set: 4 solved, 0 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/204 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 318ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1)), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p0 p1))), (F p2), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 478 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Support contains 7 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Graph (complete) has 433 edges and 204 vertex of which 203 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 202 transition count 144
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 180 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 178 transition count 142
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 49 place count 178 transition count 103
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 136 place count 130 transition count 103
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 256 place count 69 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 69 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 68 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 67 transition count 42
Applied a total of 259 rules in 15 ms. Remains 67 /204 variables (removed 137) and now considering 42/168 (removed 126) transitions.
// Phase 1: matrix 42 rows 67 cols
[2024-06-01 07:00:53] [INFO ] Computed 29 invariants in 0 ms
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 07:00:54] [INFO ] Invariant cache hit.
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 42, 44, 46, 48]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 110 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/204 places, 42/168 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 36
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 43 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 40 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 40 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 40 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 38 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 35 transition count 28
Applied a total of 28 rules in 4 ms. Remains 35 /49 variables (removed 14) and now considering 28/42 (removed 14) transitions.
// Phase 1: matrix 28 rows 35 cols
[2024-06-01 07:00:54] [INFO ] Computed 11 invariants in 0 ms
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:00:54] [INFO ] Invariant cache hit.
[2024-06-01 07:00:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [2, 4, 5, 6, 10]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 83 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/204 places, 28/168 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 27
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-06-01 07:00:54] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:00:54] [INFO ] Invariant cache hit.
[2024-06-01 07:00:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:00:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 29/204 places, 27/168 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 277 ms. Remains : 29/204 places, 27/168 transitions.
Computed a total of 27 stabilizing places and 24 stable transitions
Computed a total of 27 stabilizing places and 24 stable transitions
Detected a total of 27/29 stabilizing places and 24/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 284 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (4415 resets) in 137 ms. (289 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40003 steps (1610 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1482 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1390 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1476 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1393 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
[2024-06-01 07:00:54] [INFO ] Invariant cache hit.
[2024-06-01 07:00:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/42 variables, 15/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 4/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 5 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (AND (OR p0 p1) (OR p2 p1))))]
Knowledge based reduction with 37 factoid took 1274 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Product exploration explored 100000 steps with 11034 reset in 175 ms.
Product exploration explored 100000 steps with 11016 reset in 264 ms.
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 07:00:57] [INFO ] Invariant cache hit.
[2024-06-01 07:00:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 07:00:57] [INFO ] Invariant cache hit.
[2024-06-01 07:00:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:00:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 07:00:57] [INFO ] Redundant transitions in 21 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:00:57] [INFO ] Invariant cache hit.
[2024-06-01 07:00:57] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 24 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 63 constraints, problems are : Problem set: 0 solved, 24 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 645ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 29/29 places, 27/27 transitions.
Treatment of property BusinessProcesses-PT-03-LTLFireability-05 finished in 48045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 121 edges and 222 vertex of which 7 / 222 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 455 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 214 transition count 147
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 184 transition count 147
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 62 place count 184 transition count 105
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 156 place count 132 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 120 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 120 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 180 place count 120 transition count 92
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 182 place count 119 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 294 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 60 transition count 36
Applied a total of 296 rules in 11 ms. Remains 60 /222 variables (removed 162) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-06-01 07:00:58] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 07:00:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 07:00:58] [INFO ] Invariant cache hit.
[2024-06-01 07:00:58] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 100 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/222 places, 36/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 48/222 places, 36/186 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-06 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 6 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-06-01 07:00:58] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 07:00:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:00:58] [INFO ] Invariant cache hit.
[2024-06-01 07:00:58] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/274 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 286 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10414 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 41/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/293 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 167/460 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 7/467 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 472 constraints, problems are : Problem set: 0 solved, 167 unsolved in 20526 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 60/60 constraints]
After SMT, in 30958ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 30960ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31150 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-07
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-07 finished in 31336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 203 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 203 transition count 167
Applied a total of 38 rules in 12 ms. Remains 203 /222 variables (removed 19) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-06-01 07:01:29] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 07:01:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 07:01:29] [INFO ] Invariant cache hit.
[2024-06-01 07:01:30] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 07:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 167/370 variables, 203/272 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/370 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 280 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10528 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 36/77 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 51 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/370 variables, 203/294 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 166/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/370 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/370 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/370 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 166 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 1)
(s11 0)
(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 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 470 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 60/60 constraints]
After SMT, in 40561ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 40563ms
Starting structural reductions in LTL mode, iteration 1 : 203/222 places, 167/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40816 ms. Remains : 203/222 places, 167/186 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3619 steps with 42 reset in 5 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-08 finished in 40925 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||G((p1&&X(G((p1||G(p2))))))))))'
Support contains 1 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 6 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-06-01 07:02:10] [INFO ] Computed 41 invariants in 1 ms
[2024-06-01 07:02:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 07:02:10] [INFO ] Invariant cache hit.
[2024-06-01 07:02:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/284 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 52 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 52 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 302 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11477 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 168/372 variables, 204/323 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 167/490 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/372 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 502 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 90/90 constraints]
After SMT, in 41508ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 41510ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41704 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4940 steps with 57 reset in 15 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-09 finished in 41859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (p1||X((G(p2) U (p1&&G(p2)))))))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 175
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 175
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 205 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 205 transition count 169
Applied a total of 34 rules in 8 ms. Remains 205 /222 variables (removed 17) and now considering 169/186 (removed 17) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-06-01 07:02:52] [INFO ] Computed 41 invariants in 1 ms
[2024-06-01 07:02:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 07:02:52] [INFO ] Invariant cache hit.
[2024-06-01 07:02:52] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-06-01 07:02:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/374 variables, 205/282 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 297 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9605 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/374 variables, 205/300 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 168/468 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:06] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:07] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 9/477 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:03:09] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:09] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 486 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 72/72 constraints]
After SMT, in 39639ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 39641ms
Starting structural reductions in LTL mode, iteration 1 : 205/222 places, 169/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39903 ms. Remains : 205/222 places, 169/186 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p2)), true, (NOT p2), p0, (AND (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-10 finished in 40121 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(p1)))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 7 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-06-01 07:03:32] [INFO ] Computed 41 invariants in 3 ms
[2024-06-01 07:03:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 07:03:32] [INFO ] Invariant cache hit.
[2024-06-01 07:03:32] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-06-01 07:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 168/372 variables, 204/280 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 14/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:42] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/372 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13873 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 167/468 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 7/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 475 constraints, problems are : Problem set: 0 solved, 167 unsolved in 15985 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 63/63 constraints]
After SMT, in 29889ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 29891ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30112 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 431 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-12 finished in 30449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||X(p2))))))'
Support contains 6 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 208 transition count 172
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 208 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 202 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 202 transition count 166
Applied a total of 40 rules in 5 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-06-01 07:04:03] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 07:04:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 07:04:03] [INFO ] Invariant cache hit.
[2024-06-01 07:04:03] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 07:04:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8976 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:04:31] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 39000ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39002ms
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39236 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Computed a total of 196 stabilizing places and 158 stable transitions
Graph (complete) has 429 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 196 stabilizing places and 158 stable transitions
Detected a total of 196/202 stabilizing places and 158/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 25 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-14 finished in 39602 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(X(p3)&&p2)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-03-LTLFireability-03
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 116 edges and 222 vertex of which 7 / 222 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 455 edges and 216 vertex of which 215 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 214 transition count 149
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 186 transition count 149
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 58 place count 186 transition count 109
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 147 place count 137 transition count 109
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 128 transition count 100
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 128 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 128 transition count 99
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 167 place count 127 transition count 99
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 284 place count 68 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 67 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 66 transition count 40
Applied a total of 286 rules in 16 ms. Remains 66 /222 variables (removed 156) and now considering 40/186 (removed 146) transitions.
// Phase 1: matrix 40 rows 66 cols
[2024-06-01 07:04:43] [INFO ] Computed 30 invariants in 0 ms
[2024-06-01 07:04:43] [INFO ] Implicit Places using invariants in 51 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/222 places, 40/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 69 ms. Remains : 64/222 places, 40/186 transitions.
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-03
Product exploration explored 100000 steps with 39823 reset in 166 ms.
Product exploration explored 100000 steps with 40010 reset in 186 ms.
Computed a total of 64 stabilizing places and 39 stable transitions
Computed a total of 64 stabilizing places and 39 stable transitions
Detected a total of 64/64 stabilizing places and 39/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X p3), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1679 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), false, false]
RANDOM walk for 40000 steps (11385 resets) in 146 ms. (272 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40002 steps (5247 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (5333 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (5235 resets) in 81 ms. (487 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (5257 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
// Phase 1: matrix 40 rows 64 cols
[2024-06-01 07:04:45] [INFO ] Computed 28 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/62 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 8 (OVERLAPS) 40/102 variables, 38/72 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 19/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/103 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/103 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 92 constraints, problems are : Problem set: 2 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/62 variables, 14/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 6/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/102 variables, 38/73 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 19/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf8 is UNSAT
After SMT solving in domain Int declared 103/104 variables, and 93 constraints, problems are : Problem set: 3 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X p3), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p1 p2 p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p0)]
Knowledge based reduction with 32 factoid took 5515 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 07:04:51] [INFO ] Invariant cache hit.
[2024-06-01 07:04:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 07:04:51] [INFO ] Invariant cache hit.
[2024-06-01 07:04:52] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [0, 1, 2, 5, 6, 7, 8, 9, 10, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 40, 41, 43, 45, 47, 49]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 131 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/64 places, 40/40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 30 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 29 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 27 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 27 transition count 31
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 27 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 26 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 21 place count 25 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 22 place count 25 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 30 place count 21 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 21 transition count 24
Applied a total of 31 rules in 9 ms. Remains 21 /36 variables (removed 15) and now considering 24/40 (removed 16) transitions.
// Phase 1: matrix 24 rows 21 cols
[2024-06-01 07:04:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:04:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 07:04:52] [INFO ] Invariant cache hit.
[2024-06-01 07:04:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/64 places, 24/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 21/64 places, 24/40 transitions.
Computed a total of 21 stabilizing places and 23 stable transitions
Graph (complete) has 52 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 23 stable transitions
Detected a total of 21/21 stabilizing places and 23/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1174 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
RANDOM walk for 40000 steps (12957 resets) in 48 ms. (816 steps per ms) remains 1/12 properties
BEST_FIRST walk for 37742 steps (5184 resets) in 18 ms. (1986 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1)]
Knowledge based reduction with 26 factoid took 4708 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Product exploration explored 100000 steps with 40127 reset in 89 ms.
Product exploration explored 100000 steps with 39961 reset in 100 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 07:04:59] [INFO ] Invariant cache hit.
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:04:59] [INFO ] Invariant cache hit.
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 07:04:59] [INFO ] Redundant transitions in 21 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 07:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 23/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 21 unsolved in 149 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 23/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 42 constraints, problems are : Problem set: 0 solved, 21 unsolved in 174 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 21/21 places, 24/24 transitions.
Treatment of property BusinessProcesses-PT-03-LTLFireability-03 finished in 16473 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 U (p1||X(!p2))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-03-LTLFireability-05
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (complete) has 463 edges and 222 vertex of which 221 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 220 transition count 159
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 195 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 193 transition count 157
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 55 place count 193 transition count 114
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 150 place count 141 transition count 114
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 163 place count 128 transition count 101
Iterating global reduction 3 with 13 rules applied. Total rules applied 176 place count 128 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 176 place count 128 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 127 transition count 100
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 292 place count 69 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 69 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 68 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 67 transition count 42
Applied a total of 295 rules in 13 ms. Remains 67 /222 variables (removed 155) and now considering 42/186 (removed 144) transitions.
// Phase 1: matrix 42 rows 67 cols
[2024-06-01 07:04:59] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 07:04:59] [INFO ] Invariant cache hit.
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 42, 44, 46, 48]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 100 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 49/222 places, 42/186 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 36
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 43 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 40 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 40 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 40 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 38 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 35 transition count 28
Applied a total of 28 rules in 2 ms. Remains 35 /49 variables (removed 14) and now considering 28/42 (removed 14) transitions.
// Phase 1: matrix 28 rows 35 cols
[2024-06-01 07:04:59] [INFO ] Computed 11 invariants in 0 ms
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:04:59] [INFO ] Invariant cache hit.
[2024-06-01 07:04:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 07:04:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [2, 4, 5, 6, 10]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 60 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 30/222 places, 28/186 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 27
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-06-01 07:04:59] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 07:05:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 07:05:00] [INFO ] Invariant cache hit.
[2024-06-01 07:05:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:05:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 29/222 places, 27/186 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 232 ms. Remains : 29/222 places, 27/186 transitions.
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-05
Product exploration explored 100000 steps with 10981 reset in 90 ms.
Product exploration explored 100000 steps with 11200 reset in 90 ms.
Computed a total of 27 stabilizing places and 24 stable transitions
Computed a total of 27 stabilizing places and 24 stable transitions
Detected a total of 27/29 stabilizing places and 24/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 221 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
RANDOM walk for 40000 steps (4322 resets) in 317 ms. (125 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (1490 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1568 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1373 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1478 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
[2024-06-01 07:05:01] [INFO ] Invariant cache hit.
[2024-06-01 07:05:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/42 variables, 15/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 4/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 4 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1)), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p0 p1))), (F p2), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 414 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 07:05:01] [INFO ] Invariant cache hit.
[2024-06-01 07:05:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 07:05:01] [INFO ] Invariant cache hit.
[2024-06-01 07:05:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:05:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 07:05:01] [INFO ] Redundant transitions in 17 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:05:01] [INFO ] Invariant cache hit.
[2024-06-01 07:05:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 24 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 63 constraints, problems are : Problem set: 0 solved, 24 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 520ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 591 ms. Remains : 29/29 places, 27/27 transitions.
Computed a total of 27 stabilizing places and 24 stable transitions
Computed a total of 27 stabilizing places and 24 stable transitions
Detected a total of 27/29 stabilizing places and 24/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 308 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (4381 resets) in 242 ms. (164 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40001 steps (1570 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1465 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1382 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1487 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1384 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
[2024-06-01 07:05:03] [INFO ] Invariant cache hit.
[2024-06-01 07:05:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/42 variables, 15/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 4/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 5 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1)))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (AND (OR p0 p1) (OR p2 p1))))]
Knowledge based reduction with 37 factoid took 1043 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 p1), true, false, false]
Product exploration explored 100000 steps with 11001 reset in 137 ms.
Product exploration explored 100000 steps with 11111 reset in 148 ms.
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 07:05:05] [INFO ] Invariant cache hit.
[2024-06-01 07:05:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 07:05:05] [INFO ] Invariant cache hit.
[2024-06-01 07:05:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:05:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 07:05:05] [INFO ] Redundant transitions in 24 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:05:05] [INFO ] Invariant cache hit.
[2024-06-01 07:05:05] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 24 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 63 constraints, problems are : Problem set: 0 solved, 24 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 29/29 places, 27/27 transitions.
Treatment of property BusinessProcesses-PT-03-LTLFireability-05 finished in 6696 ms.
[2024-06-01 07:05:06] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:05:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:05:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 222 places, 186 transitions and 528 arcs took 5 ms.
Total runtime 464692 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-03-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-03-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225875556

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-03-LTLFireability-01
ltl formula formula --ltl=/tmp/4596/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 222 places, 186 transitions and 528 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4596/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4596/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4596/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4596/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 223 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 223, there are 192 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~88 levels ~10000 states ~42148 transitions
pnml2lts-mc( 2/ 4): ~88 levels ~20000 states ~93020 transitions
pnml2lts-mc( 2/ 4): ~88 levels ~40000 states ~203920 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~80000 states ~468132 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~160000 states ~1042368 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~320000 states ~2208112 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~640000 states ~4734888 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~1280000 states ~9580908 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~2560000 states ~20372364 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~5120000 states ~43661564 transitions
pnml2lts-mc( 0/ 4): ~282 levels ~10240000 states ~92817404 transitions
pnml2lts-mc( 2/ 4): ~88 levels ~20480000 states ~176659552 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16791451
pnml2lts-mc( 0/ 4): unique states count: 33552702
pnml2lts-mc( 0/ 4): unique transitions count: 317048493
pnml2lts-mc( 0/ 4): - self-loop count: 17
pnml2lts-mc( 0/ 4): - claim dead count: 278976409
pnml2lts-mc( 0/ 4): - claim found count: 5681635
pnml2lts-mc( 0/ 4): - claim success count: 33747957
pnml2lts-mc( 0/ 4): - cum. max stack depth: 858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33807095 states 319696902 transitions, fanout: 9.457
pnml2lts-mc( 0/ 4): Total exploration time 146.160 sec (146.130 sec minimum, 146.143 sec on average)
pnml2lts-mc( 0/ 4): States per second: 231302, Transitions per second: 2187308
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 265.6MB, 8.3 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/14.0%
pnml2lts-mc( 0/ 4): Stored 186 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 265.6MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-03-LTLFireability-03
ltl formula formula --ltl=/tmp/4596/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 222 places, 186 transitions and 528 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4596/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4596/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4596/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4596/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 223 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 223, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~68 levels ~10000 states ~37036 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~20000 states ~82644 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~40000 states ~181940 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~80000 states ~403172 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~160000 states ~846236 transitions
pnml2lts-mc( 1/ 4): ~68 levels ~320000 states ~1850108 transitions
pnml2lts-mc( 2/ 4): ~285 levels ~640000 states ~4592768 transitions
pnml2lts-mc( 2/ 4): ~285 levels ~1280000 states ~9820172 transitions
pnml2lts-mc( 0/ 4): ~307 levels ~2560000 states ~19905104 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~150!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2154533
pnml2lts-mc( 0/ 4): unique states count: 3009747
pnml2lts-mc( 0/ 4): unique transitions count: 22554959
pnml2lts-mc( 0/ 4): - self-loop count: 13
pnml2lts-mc( 0/ 4): - claim dead count: 19343542
pnml2lts-mc( 0/ 4): - claim found count: 288320
pnml2lts-mc( 0/ 4): - claim success count: 3024930
pnml2lts-mc( 0/ 4): - cum. max stack depth: 883
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3026634 states 22753193 transitions, fanout: 7.518
pnml2lts-mc( 0/ 4): Total exploration time 14.800 sec (14.790 sec minimum, 14.797 sec on average)
pnml2lts-mc( 0/ 4): States per second: 204502, Transitions per second: 1537378
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 23.8MB, 8.3 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 186 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 23.8MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-03-LTLFireability-05
ltl formula formula --ltl=/tmp/4596/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 222 places, 186 transitions and 528 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4596/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4596/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4596/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4596/ltl_2_
pnml2lts-mc( 0/ 4): There are 223 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 223, there are 231 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~67 levels ~10000 states ~111272 transitions
pnml2lts-mc( 3/ 4): ~67 levels ~20000 states ~245272 transitions
pnml2lts-mc( 3/ 4): ~67 levels ~40000 states ~526272 transitions
pnml2lts-mc( 3/ 4): ~67 levels ~80000 states ~1126416 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~160000 states ~982144 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~320000 states ~2099000 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~640000 states ~4461136 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~1280000 states ~9552112 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~2560000 states ~20238072 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~5120000 states ~42963956 transitions
pnml2lts-mc( 2/ 4): ~223 levels ~10240000 states ~88785484 transitions
pnml2lts-mc( 2/ 4): ~224 levels ~20480000 states ~187252584 transitions
pnml2lts-mc( 1/ 4): ~340 levels ~40960000 states ~393848332 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17959271
pnml2lts-mc( 0/ 4): unique states count: 33553062
pnml2lts-mc( 0/ 4): unique transitions count: 490017256
pnml2lts-mc( 0/ 4): - self-loop count: 17
pnml2lts-mc( 0/ 4): - claim dead count: 451357050
pnml2lts-mc( 0/ 4): - claim found count: 5203927
pnml2lts-mc( 0/ 4): - claim success count: 33568941
pnml2lts-mc( 0/ 4): - cum. max stack depth: 699
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33572249 states 490221524 transitions, fanout: 14.602
pnml2lts-mc( 0/ 4): Total exploration time 207.090 sec (207.050 sec minimum, 207.065 sec on average)
pnml2lts-mc( 0/ 4): States per second: 162114, Transitions per second: 2367191
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 298.8MB, 9.3 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/66.0%
pnml2lts-mc( 0/ 4): Stored 186 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 298.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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