Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 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 47K 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-01-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717224912858

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:55:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:55:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:55:14] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-01 06:55:14] [INFO ] Transformed 200 places.
[2024-06-01 06:55:14] [INFO ] Transformed 178 transitions.
[2024-06-01 06:55:14] [INFO ] Found NUPN structural information;
[2024-06-01 06:55:14] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 181 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 6 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 170 transition count 150
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 170 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 170 transition count 149
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 72 place count 155 transition count 134
Iterating global reduction 2 with 15 rules applied. Total rules applied 87 place count 155 transition count 134
Applied a total of 87 rules in 97 ms. Remains 155 /199 variables (removed 44) and now considering 134/177 (removed 43) transitions.
// Phase 1: matrix 134 rows 155 cols
[2024-06-01 06:55:14] [INFO ] Computed 28 invariants in 16 ms
[2024-06-01 06:55:15] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 06:55:15] [INFO ] Invariant cache hit.
[2024-06-01 06:55:15] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-06-01 06:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 16 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 8 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 132 unsolved
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 20/68 constraints. Problems are: Problem set: 2 solved, 131 unsolved
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 11/79 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/80 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 9/89 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 2/91 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 2 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 4/95 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/95 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 134/289 variables, 155/250 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 9/259 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 4/263 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/289 variables, 4/267 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 0/267 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/289 variables, 1/268 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 1/269 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 0/269 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 21 (OVERLAPS) 0/289 variables, 0/269 constraints. Problems are: Problem set: 4 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 269 constraints, problems are : Problem set: 4 solved, 129 unsolved in 19836 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 4 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 18/27 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 86/114 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/116 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/117 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 2/120 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 134/289 variables, 155/275 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 129/404 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 1/405 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/405 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/289 variables, 1/406 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/406 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 16 (OVERLAPS) 0/289 variables, 0/406 constraints. Problems are: Problem set: 4 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 406 constraints, problems are : Problem set: 4 solved, 129 unsolved in 19016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 129/133 constraints, Known Traps: 94/94 constraints]
After SMT, in 38933ms problems are : Problem set: 4 solved, 129 unsolved
Search for dead transitions found 4 dead transitions in 38954ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/199 places, 130/177 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 130
Applied a total of 2 rules in 8 ms. Remains 153 /155 variables (removed 2) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 153 cols
[2024-06-01 06:55:54] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 06:55:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 06:55:54] [INFO ] Invariant cache hit.
[2024-06-01 06:55:54] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/199 places, 130/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39811 ms. Remains : 153/199 places, 130/177 transitions.
Support contains 23 out of 153 places after structural reductions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 40 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 130 transitions.
RANDOM walk for 40000 steps (459 resets) in 896 ms. (44 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40004 steps (122 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
[2024-06-01 06:55:55] [INFO ] Invariant cache hit.
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) 117/120 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 120/283 variables, and 19 constraints, problems are : Problem set: 1 solved, 0 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 156ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 123 stabilizing places and 101 stable transitions
Graph (complete) has 310 edges and 153 vertex of which 152 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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((p0||F(p1))))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 144 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 144 transition count 121
Applied a total of 18 rules in 9 ms. Remains 144 /153 variables (removed 9) and now considering 121/130 (removed 9) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-06-01 06:55:55] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 06:55:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 06:55:55] [INFO ] Invariant cache hit.
[2024-06-01 06:55:56] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 06:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 3 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/192 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:56:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/265 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 203 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 120/328 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 335 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10442 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 43/43 constraints]
After SMT, in 18481ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 18484ms
Starting structural reductions in LTL mode, iteration 1 : 144/153 places, 121/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18708 ms. Remains : 144/153 places, 121/130 transitions.
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-00
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-00 finished in 19225 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)||G(F(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Graph (trivial) has 77 edges and 153 vertex of which 7 / 153 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 302 edges and 147 vertex of which 146 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 146 transition count 105
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 129 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 128 transition count 104
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 38 place count 128 transition count 74
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 104 place count 92 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 88 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 88 transition count 70
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 188 place count 49 transition count 33
Applied a total of 188 rules in 39 ms. Remains 49 /153 variables (removed 104) and now considering 33/130 (removed 97) transitions.
// Phase 1: matrix 33 rows 49 cols
[2024-06-01 06:56:15] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 06:56:15] [INFO ] Implicit Places using invariants in 75 ms returned [2, 3, 8, 9, 10, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 91 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/153 places, 33/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 43/153 places, 33/130 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-01
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-01 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 146 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 146 transition count 123
Applied a total of 14 rules in 22 ms. Remains 146 /153 variables (removed 7) and now considering 123/130 (removed 7) transitions.
// Phase 1: matrix 123 rows 146 cols
[2024-06-01 06:56:15] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 06:56:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 06:56:15] [INFO ] Invariant cache hit.
[2024-06-01 06:56:15] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:56:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/269 variables, 146/198 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:22] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/269 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/269 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 20 (OVERLAPS) 0/269 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 220 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12777 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 46/74 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/269 variables, 146/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 122/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/269 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 352 constraints, problems are : Problem set: 0 solved, 122 unsolved in 13711 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 56/56 constraints]
After SMT, in 26511ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 26513ms
Starting structural reductions in LTL mode, iteration 1 : 146/153 places, 123/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26741 ms. Remains : 146/153 places, 123/130 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 1152 reset in 224 ms.
Stack based approach found an accepted trace after 10881 steps with 132 reset with depth 102 and stack size 96 in 17 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-02 finished in 27175 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)&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Graph (trivial) has 78 edges and 153 vertex of which 7 / 153 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 302 edges and 147 vertex of which 146 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 145 transition count 103
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 127 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 126 transition count 102
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 40 place count 126 transition count 75
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 100 place count 93 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 91 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 91 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 91 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 90 transition count 72
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 182 place count 51 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 50 transition count 38
Applied a total of 184 rules in 25 ms. Remains 50 /153 variables (removed 103) and now considering 38/130 (removed 92) transitions.
// Phase 1: matrix 38 rows 50 cols
[2024-06-01 06:56:42] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants in 176 ms returned [1, 2, 5, 6, 7, 12]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 178 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/153 places, 38/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 44/153 places, 38/130 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-03 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||F(G(p1))))||F(p0))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 144 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 144 transition count 121
Applied a total of 18 rules in 6 ms. Remains 144 /153 variables (removed 9) and now considering 121/130 (removed 9) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-06-01 06:56:42] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 06:56:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/189 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/265 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/265 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 204 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8768 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/328 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 332 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7228 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 40/40 constraints]
After SMT, in 16025ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 16028ms
Starting structural reductions in LTL mode, iteration 1 : 144/153 places, 121/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16255 ms. Remains : 144/153 places, 121/130 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-04
Stuttering criterion allowed to conclude after 319 steps with 3 reset in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-04 finished in 16375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U G(!p1)))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 143 transition count 120
Applied a total of 20 rules in 6 ms. Remains 143 /153 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-06-01 06:56:59] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 06:56:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 06:56:59] [INFO ] Invariant cache hit.
[2024-06-01 06:56:59] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-01 06:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:09] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 4 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/263 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:14] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:14] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 214 constraints, problems are : Problem set: 0 solved, 119 unsolved in 17008 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 43/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:16] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 120/263 variables, 143/222 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 119/341 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 345 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12195 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 55/55 constraints]
After SMT, in 29221ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 29224ms
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 120/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29453 ms. Remains : 143/153 places, 120/130 transitions.
Stuttering acceptance computed with spot in 182 ms :[p1, p0, (AND p1 p0), true, (AND p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-06
Product exploration explored 100000 steps with 33249 reset in 214 ms.
Product exploration explored 100000 steps with 33410 reset in 172 ms.
Computed a total of 120 stabilizing places and 98 stable transitions
Graph (complete) has 296 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 120 stabilizing places and 98 stable transitions
Detected a total of 120/143 stabilizing places and 98/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 344 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[p1, (AND (NOT p1) p0), true, (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (448 resets) in 300 ms. (132 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (103 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
[2024-06-01 06:57:29] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 5/263 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 14 factoid took 608 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLFireability-06 finished in 31480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Graph (trivial) has 79 edges and 153 vertex of which 7 / 153 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 302 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 145 transition count 101
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 125 transition count 101
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 42 place count 125 transition count 75
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 99 place count 94 transition count 75
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 90 transition count 71
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 90 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 107 place count 90 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 89 transition count 70
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 185 place count 50 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 49 transition count 36
Applied a total of 187 rules in 17 ms. Remains 49 /153 variables (removed 104) and now considering 36/130 (removed 94) transitions.
// Phase 1: matrix 36 rows 49 cols
[2024-06-01 06:57:30] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 06:57:30] [INFO ] Implicit Places using invariants in 80 ms returned [1, 2, 5, 6, 7, 8, 14]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 82 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/153 places, 36/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 42/153 places, 36/130 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-11 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 147 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 147 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 145 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 145 transition count 122
Applied a total of 16 rules in 5 ms. Remains 145 /153 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 145 cols
[2024-06-01 06:57:30] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 06:57:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 06:57:30] [INFO ] Invariant cache hit.
[2024-06-01 06:57:31] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 06:57:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/267 variables, 145/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/267 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 196 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6896 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/267 variables, 145/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 121/317 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 325 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8927 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 31/31 constraints]
After SMT, in 15842ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15844ms
Starting structural reductions in LTL mode, iteration 1 : 145/153 places, 122/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16091 ms. Remains : 145/153 places, 122/130 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-12
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-12 finished in 16216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 143 transition count 120
Applied a total of 20 rules in 5 ms. Remains 143 /153 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-06-01 06:57:47] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 06:57:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 06:57:47] [INFO ] Invariant cache hit.
[2024-06-01 06:57:47] [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 119 sub problems to find dead transitions.
[2024-06-01 06:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:49] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:50] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:52] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/263 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:55] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 214 constraints, problems are : Problem set: 0 solved, 119 unsolved in 10396 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 43/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 120/263 variables, 143/222 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 119/341 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 345 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13212 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 55/55 constraints]
After SMT, in 23636ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 23638ms
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 120/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23880 ms. Remains : 143/153 places, 120/130 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-13 finished in 24010 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 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 130/130 transitions.
Graph (trivial) has 79 edges and 153 vertex of which 7 / 153 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 302 edges and 147 vertex of which 146 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 145 transition count 102
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 126 transition count 102
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 40 place count 126 transition count 75
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 100 place count 93 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 90 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 90 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 90 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 89 transition count 71
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 182 place count 51 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 50 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 49 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 48 transition count 37
Applied a total of 186 rules in 24 ms. Remains 48 /153 variables (removed 105) and now considering 37/130 (removed 93) transitions.
// Phase 1: matrix 37 rows 48 cols
[2024-06-01 06:58:11] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:58:11] [INFO ] Implicit Places using invariants in 47 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/153 places, 37/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 46/153 places, 37/130 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-15 finished in 154 ms.
All properties solved by simple procedures.
Total runtime 176800 ms.
ITS solved all properties within timeout

BK_STOP 1717225091275

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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