Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-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 itstools
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 r048-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 1716333698000

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:21:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:21:39] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 23:21:39] [INFO ] Transformed 274 places.
[2024-05-21 23:21:39] [INFO ] Transformed 237 transitions.
[2024-05-21 23:21:39] [INFO ] Found NUPN structural information;
[2024-05-21 23:21:39] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-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 57 ms. Remains 222 /273 variables (removed 51) and now considering 186/236 (removed 50) transitions.
// Phase 1: matrix 186 rows 222 cols
[2024-05-21 23:21:39] [INFO ] Computed 41 invariants in 15 ms
[2024-05-21 23:21:39] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 23:21:39] [INFO ] Invariant cache hit.
[2024-05-21 23:21:40] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 23:21:40] [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-05-21 23:21:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 19 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:21:42] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 13 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 5 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:21:43] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 45 places in 54 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-05-21 23:21:46] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 25 places in 34 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-05-21 23:21:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 33 places in 61 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-05-21 23:21:50] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 28 places in 32 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-05-21 23:21:51] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:21:52] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 24 places in 25 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-05-21 23:21:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 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-05-21 23:21:56] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 52 places in 62 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-05-21 23:21:59] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 44 places in 71 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-05-21 23:22:02] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 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 25897 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-05-21 23:22:07] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 32 places in 35 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-05-21 23:22:09] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:11] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:12] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/556 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:17] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:17] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:18] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:18] [INFO ] Deduced a trap composed of 14 places in 31 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-05-21 23:22:22] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:22:29] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
SMT process timed out in 55998ms, After SMT, problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 56013ms
Starting structural reductions in LTL mode, iteration 1 : 222/273 places, 186/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56491 ms. Remains : 222/273 places, 186/236 transitions.
Support contains 39 out of 222 places after structural reductions.
[2024-05-21 23:22:36] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:22:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:22:36] [INFO ] Input system was already deterministic with 186 transitions.
RANDOM walk for 40000 steps (465 resets) in 1757 ms. (22 steps per ms) remains 5/31 properties
BEST_FIRST walk for 40003 steps (89 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (90 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
[2024-05-21 23:22:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 144/204 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 26/398 variables, 11/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 5/265 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/406 variables, 6/271 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/408 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 4/276 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 276 constraints, problems are : Problem set: 1 solved, 4 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 173/204 variables, 38/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 12/53 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 6/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 168/372 variables, 204/263 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/266 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 26/398 variables, 11/277 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 1/278 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 1/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/406 variables, 6/285 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/408 variables, 1/286 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/408 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 286 constraints, problems are : Problem set: 1 solved, 4 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 19/19 constraints]
After SMT, in 1174ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=67 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6 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.5 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.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 33 ms. Remains 61 /222 variables (removed 161) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 61 cols
[2024-05-21 23:22:38] [INFO ] Computed 29 invariants in 0 ms
[2024-05-21 23:22:38] [INFO ] Implicit Places using invariants in 38 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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 2 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 74 ms. Remains : 60/222 places, 36/186 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 22350 reset in 226 ms.
Product exploration explored 100000 steps with 22420 reset in 150 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 96 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 24 ms :[(NOT p0)]
RANDOM walk for 39958 steps (11407 resets) in 211 ms. (188 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 80 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 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 2 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-05-21 23:22:39] [INFO ] Computed 28 invariants in 0 ms
[2024-05-21 23:22:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 23:22:39] [INFO ] Invariant cache hit.
[2024-05-21 23:22:39] [INFO ] Implicit Places using invariants and state equation in 66 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 104 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 4 ms. Remains 18 /32 variables (removed 14) and now considering 22/36 (removed 14) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-21 23:22:39] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 23:22:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 23:22:39] [INFO ] Invariant cache hit.
[2024-05-21 23:22:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 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 150 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 61 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)]
RANDOM walk for 24647 steps (8052 resets) in 20 ms. (1173 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 76 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 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24883 reset in 47 ms.
Product exploration explored 100000 steps with 24616 reset in 144 ms.
Built C files in :
/tmp/ltsmin13605452815549848506
[2024-05-21 23:22:40] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 23:22:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:22:40] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 23:22:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:22:40] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 23:22:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:22:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13605452815549848506
Running compilation step : cd /tmp/ltsmin13605452815549848506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin13605452815549848506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13605452815549848506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8247967933269246752.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-01 finished in 1980 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 12 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-21 23:22:40] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:22:40] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 23:22:40] [INFO ] Invariant cache hit.
[2024-05-21 23:22:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:22:40] [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-05-21 23:22:41] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:41] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:41] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 36 places in 61 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-05-21 23:22:47] [INFO ] Deduced a trap composed of 16 places in 37 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 9676 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-05-21 23:22:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 48 places in 64 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-05-21 23:23:05] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 24 places in 41 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-05-21 23:23:17] [INFO ] Deduced a trap composed of 25 places in 39 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 30017 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 39719ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39723ms
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39945 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 356 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 1802 reset in 160 ms.
Stack based approach found an accepted trace after 498 steps with 8 reset with depth 25 and stack size 25 in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-02 finished in 40480 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 9 ms. Remains 206 /222 variables (removed 16) and now considering 170/186 (removed 16) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-21 23:23:21] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:23:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 23:23:21] [INFO ] Invariant cache hit.
[2024-05-21 23:23:21] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-21 23:23:21] [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-05-21 23:23:22] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 24 places in 36 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-05-21 23:23:26] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 3 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 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-05-21 23:23:29] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 7 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 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-05-21 23:23:35] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 29 places in 41 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 18116 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-05-21 23:23:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 36 places in 44 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-05-21 23:23:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:23:41] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 19 places in 28 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-05-21 23:23:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 42 places in 55 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-05-21 23:24:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 33 places in 64 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-05-21 23:24:07] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:08] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:08] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 518 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 102/102 constraints]
After SMT, in 48148ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 48150ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 170/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48365 ms. Remains : 206/222 places, 170/186 transitions.
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) (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 33359 reset in 281 ms.
Product exploration explored 100000 steps with 33320 reset in 191 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.4 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 1854 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 287 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 (476 resets) in 1111 ms. (35 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 287 ms. (138 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
[2024-05-21 23:24:12] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 157/196 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 160/356 variables, 196/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 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, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/376 variables, 3/247 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 247 constraints, problems are : Problem set: 2 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 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) 35/39 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 157/196 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 160/356 variables, 196/239 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf8 is UNSAT
After SMT solving in domain Int declared 371/376 variables, and 246 constraints, problems are : Problem set: 3 solved, 0 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/206 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 401ms 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 4984 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 196 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 170 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 0 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 21 ms. Remains 66 /206 variables (removed 140) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 66 cols
[2024-05-21 23:24:18] [INFO ] Computed 30 invariants in 1 ms
[2024-05-21 23:24:18] [INFO ] Implicit Places using invariants in 48 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 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 75 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 1164 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 292 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 (11348 resets) in 109 ms. (363 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40002 steps (5180 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
// Phase 1: matrix 40 rows 64 cols
[2024-05-21 23:24:20] [INFO ] Computed 28 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/17 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/57 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/59 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/102 variables, 42/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/103 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/103 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/17 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/57 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/59 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/102 variables, 42/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/103 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/103 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
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 3777 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 302 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 246 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 232 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 39925 reset in 233 ms.
Product exploration explored 100000 steps with 39705 reset in 223 ms.
Built C files in :
/tmp/ltsmin8471296768150560990
[2024-05-21 23:24:25] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-21 23:24:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:25] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-21 23:24:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:25] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-21 23:24:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8471296768150560990
Running compilation step : cd /tmp/ltsmin8471296768150560990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin8471296768150560990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8471296768150560990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9515486781338471172.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-03 finished in 64717 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-05-21 23:24:25] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:24:25] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:24:25] [INFO ] Invariant cache hit.
[2024-05-21 23:24:25] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:24:26] [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-05-21 23:24:27] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 38 places in 60 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-05-21 23:24:30] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 46 places in 46 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-05-21 23:24:33] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 49 places in 41 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 11287 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-05-21 23:24:39] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 13/469 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 19 places in 43 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-05-21 23:24:48] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 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-05-21 23:25:02] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/372 variables, 4/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 30012 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 41325ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 41327ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41562 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 267 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 1196 reset in 198 ms.
Product exploration explored 100000 steps with 1191 reset in 181 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.3 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 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 298 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 277 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
RANDOM walk for 40000 steps (474 resets) in 234 ms. (170 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (78 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (93 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
[2024-05-21 23:25:08] [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-05-21 23:25:08] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 19 places in 28 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-05-21 23:25:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 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 426 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 431ms 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 641 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 324 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 346 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.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 31 ms. Remains 67 /204 variables (removed 137) and now considering 42/168 (removed 126) transitions.
// Phase 1: matrix 42 rows 67 cols
[2024-05-21 23:25:10] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 23:25:10] [INFO ] Invariant cache hit.
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants and state equation in 74 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 138 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 8 ms. Remains 35 /49 variables (removed 14) and now considering 28/42 (removed 14) transitions.
// Phase 1: matrix 28 rows 35 cols
[2024-05-21 23:25:10] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 23:25:10] [INFO ] Invariant cache hit.
[2024-05-21 23:25:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [2, 4, 5, 6, 10]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 90 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 3 ms. Remains 29 /30 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-05-21 23:25:10] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 23:25:10] [INFO ] Invariant cache hit.
[2024-05-21 23:25:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:25:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 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 353 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 527 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 336 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 (4399 resets) in 239 ms. (166 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40003 steps (1588 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1468 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1361 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1455 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1370 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
[2024-05-21 23:25:11] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [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 65 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 74ms 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 1287 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 311 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 311 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 336 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 11185 reset in 230 ms.
Product exploration explored 100000 steps with 11027 reset in 195 ms.
Built C files in :
/tmp/ltsmin9823542919270724192
[2024-05-21 23:25:14] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-21 23:25:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:14] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-21 23:25:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:14] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-21 23:25:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:25:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9823542919270724192
Running compilation step : cd /tmp/ltsmin9823542919270724192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin9823542919270724192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9823542919270724192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17439709492419842601.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-05 finished in 49367 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 1 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 21 ms. Remains 60 /222 variables (removed 162) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-05-21 23:25:15] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:25:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 23:25:15] [INFO ] Invariant cache hit.
[2024-05-21 23:25:15] [INFO ] Implicit Places using invariants and state equation in 77 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 128 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 153 ms. Remains : 48/222 places, 36/186 transitions.
Stuttering acceptance computed with spot in 64 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 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 13 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:25:15] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:25:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:25:15] [INFO ] Invariant cache hit.
[2024-05-21 23:25:15] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:25:15] [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-05-21 23:25:16] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 23 places in 49 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-05-21 23:25:20] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 24 places in 44 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-05-21 23:25:22] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 3 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 46 places in 42 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 11955 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-05-21 23:25:28] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 46 places in 45 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-05-21 23:25:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 16 places in 33 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-05-21 23:25:35] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 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 21350 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 33332ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 33335ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33602 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 162 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 71 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 33783 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 10 ms. Remains 203 /222 variables (removed 19) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-21 23:25:49] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:25:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 23:25:49] [INFO ] Invariant cache hit.
[2024-05-21 23:25:49] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-21 23:25:49] [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-05-21 23:25:50] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:53] [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-05-21 23:25:54] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 32 places in 41 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-05-21 23:25:55] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 17 places in 36 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-05-21 23:25:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 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 11247 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-05-21 23:26:01] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 33 places in 41 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-05-21 23:26:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 51 places in 35 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-05-21 23:26:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 19 places in 35 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-05-21 23:26:12] [INFO ] Deduced a trap composed of 42 places in 56 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-05-21 23:26:19] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:26:20] [INFO ] Deduced a trap composed of 27 places in 69 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-05-21 23:26:23] [INFO ] Deduced a trap composed of 27 places in 44 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 469 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 59/59 constraints]
After SMT, in 41286ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 41288ms
Starting structural reductions in LTL mode, iteration 1 : 203/222 places, 167/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41529 ms. Remains : 203/222 places, 167/186 transitions.
Stuttering acceptance computed with spot in 141 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 514 steps with 5 reset in 2 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-08 finished in 41688 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 8 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:26:30] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:26:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:26:30] [INFO ] Invariant cache hit.
[2024-05-21 23:26:31] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:26:31] [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-05-21 23:26:32] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 17 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-05-21 23:26:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 23 places in 43 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-05-21 23:26:35] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:26:35] [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-05-21 23:26:37] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 18 places in 32 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-05-21 23:26:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:39] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:26:39] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:26:39] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:26:39] [INFO ] Deduced a trap composed of 24 places in 22 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-05-21 23:26:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:26:40] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:40] [INFO ] Deduced a trap composed of 52 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:40] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:40] [INFO ] Deduced a trap composed of 52 places in 42 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 12932 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-05-21 23:26:44] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 22 places in 23 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-05-21 23:26:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 39 places in 53 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-05-21 23:26:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 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-05-21 23:27:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 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 30011 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 42966ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 42968ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43222 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 119 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 4043 steps with 47 reset in 11 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-09 finished in 43367 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 10 ms. Remains 205 /222 variables (removed 17) and now considering 169/186 (removed 17) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-05-21 23:27:14] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:27:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 23:27:14] [INFO ] Invariant cache hit.
[2024-05-21 23:27:14] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-21 23:27:14] [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-05-21 23:27:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 29 places in 33 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-05-21 23:27:16] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 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-05-21 23:27:19] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 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 9819 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-05-21 23:27:25] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 3 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 32 places in 30 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-05-21 23:27:27] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:27:28] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 5 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 24 places in 31 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-05-21 23:27:31] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 38 places in 46 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-05-21 23:27:45] [INFO ] Deduced a trap composed of 11 places in 26 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
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 30008 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 39851ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 39853ms
Starting structural reductions in LTL mode, iteration 1 : 205/222 places, 169/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40117 ms. Remains : 205/222 places, 169/186 transitions.
Stuttering acceptance computed with spot in 242 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 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-10 finished in 40384 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 11 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:27:54] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:27:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 23:27:54] [INFO ] Invariant cache hit.
[2024-05-21 23:27:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:27:54] [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-05-21 23:27:56] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 34 places in 23 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-05-21 23:27:57] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 36 places in 35 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-05-21 23:28:02] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 47 places in 41 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-05-21 23:28:05] [INFO ] Deduced a trap composed of 19 places in 32 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-05-21 23:28:07] [INFO ] Deduced a trap composed of 23 places in 36 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 15697 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-05-21 23:28:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 47 places in 36 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-05-21 23:28:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 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 15711 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 31430ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 31435ms
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31682 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 129 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 128 ms.
Product exploration explored 100000 steps with 33333 reset in 137 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 21 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 32115 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 10 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-21 23:28:26] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:28:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 23:28:26] [INFO ] Invariant cache hit.
[2024-05-21 23:28:26] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:28:26] [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-05-21 23:28:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:28:29] [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-05-21 23:28:29] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9892 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-05-21 23:28:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 46 places in 40 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-05-21 23:28:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 32 places in 44 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-05-21 23:28:46] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 38 places in 43 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-05-21 23:28:54] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 24 places in 22 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-05-21 23:29:02] [INFO ] Deduced a trap composed of 25 places in 28 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 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 39928ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39930ms
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40174 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 187 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 101 ms.
Product exploration explored 100000 steps with 33333 reset in 106 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 23 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 40620 ms.
All properties solved by simple procedures.
Total runtime 448115 ms.

BK_STOP 1716334147373

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r048-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 ;