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-171620399600460.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K 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-02-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717224986162

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:56:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:56:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:56:27] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 06:56:27] [INFO ] Transformed 262 places.
[2024-06-01 06:56:27] [INFO ] Transformed 219 transitions.
[2024-06-01 06:56:27] [INFO ] Found NUPN structural information;
[2024-06-01 06:56:27] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 34 place count 211 transition count 176
Iterating global reduction 1 with 28 rules applied. Total rules applied 62 place count 211 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 202 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 202 transition count 167
Applied a total of 80 rules in 63 ms. Remains 202 /245 variables (removed 43) and now considering 167/204 (removed 37) transitions.
// Phase 1: matrix 167 rows 202 cols
[2024-06-01 06:56:27] [INFO ] Computed 37 invariants in 24 ms
[2024-06-01 06:56:28] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 06:56:28] [INFO ] Invariant cache hit.
[2024-06-01 06:56:28] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 06:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 17 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 167/369 variables, 202/275 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 281 constraints, problems are : Problem set: 0 solved, 166 unsolved in 13482 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 167/369 variables, 202/288 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 166/454 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/369 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 460 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15974 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 55/55 constraints]
After SMT, in 29523ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 29543ms
Starting structural reductions in LTL mode, iteration 1 : 202/245 places, 167/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30055 ms. Remains : 202/245 places, 167/204 transitions.
Support contains 35 out of 202 places after structural reductions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 39 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 31 out of 202 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (523 resets) in 1329 ms. (30 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40004 steps (101 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (103 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (104 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (105 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (103 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (106 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (105 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (103 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
[2024-06-01 06:56:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 104/144 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 33/177 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 146/323 variables, 177/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 34/357 variables, 17/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 12/369 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 242 constraints, problems are : Problem set: 0 solved, 9 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 104/144 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 33/177 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 146/323 variables, 177/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 34/357 variables, 17/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 7/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 12/369 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/369 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 262 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 1736ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2409 ms.
Support contains 9 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 91 edges and 202 vertex of which 7 / 202 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 390 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 193 transition count 133
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 171 transition count 133
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 46 place count 171 transition count 97
Deduced a syphon composed of 36 places in 5 ms
Ensure Unique test removed 6 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 124 place count 129 transition count 97
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 125 transition count 93
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 125 transition count 93
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 232 place count 74 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 74 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 73 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 73 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 72 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 71 transition count 42
Applied a total of 237 rules in 94 ms. Remains 71 /202 variables (removed 131) and now considering 42/167 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 71/202 places, 42/167 transitions.
RANDOM walk for 40000 steps (1507 resets) in 413 ms. (96 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40000 steps (1018 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
// Phase 1: matrix 42 rows 71 cols
[2024-06-01 06:57:03] [INFO ] Computed 29 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/33 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/47 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/52 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/93 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/112 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/112 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/113 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/113 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/113 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/33 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/47 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/52 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/93 variables, 52/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/93 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/112 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/112 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/112 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 113/113 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 676ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-02-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 194 stabilizing places and 157 stable transitions
Graph (complete) has 398 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (complete) has 398 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 198 transition count 139
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 174 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 172 transition count 137
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 53 place count 172 transition count 95
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 145 place count 122 transition count 95
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 155 place count 112 transition count 85
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 112 transition count 85
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 269 place count 59 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 57 transition count 32
Applied a total of 272 rules in 40 ms. Remains 57 /202 variables (removed 145) and now considering 32/167 (removed 135) transitions.
// Phase 1: matrix 32 rows 57 cols
[2024-06-01 06:57:04] [INFO ] Computed 26 invariants in 0 ms
[2024-06-01 06:57:04] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 06:57:04] [INFO ] Invariant cache hit.
[2024-06-01 06:57:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 335 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/202 places, 32/167 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 30 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 22 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 17 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 16 transition count 18
Applied a total of 28 rules in 5 ms. Remains 16 /32 variables (removed 16) and now considering 18/32 (removed 14) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-06-01 06:57:04] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 06:57:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 06:57:04] [INFO ] Invariant cache hit.
[2024-06-01 06:57:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/202 places, 18/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 461 ms. Remains : 16/202 places, 18/167 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-00
Product exploration explored 100000 steps with 19930 reset in 264 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-00 finished in 1005 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)||X(p1)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 16 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-06-01 06:57:05] [INFO ] Computed 37 invariants in 4 ms
[2024-06-01 06:57:05] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 06:57:05] [INFO ] Invariant cache hit.
[2024-06-01 06:57:05] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-06-01 06:57:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:08] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/241 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:10] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 247 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6980 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 154/343 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 153/401 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:15] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:57:15] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:15] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2024-06-01 06:57:16] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 6/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/343 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 408 constraints, problems are : Problem set: 0 solved, 153 unsolved in 13405 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 29/29 constraints]
After SMT, in 20418ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 20439ms
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20763 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-02 finished in 20927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 103 edges and 202 vertex of which 7 / 202 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 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 192 transition count 129
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 165 transition count 129
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 165 transition count 92
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 120 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 147 place count 111 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 156 place count 111 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 256 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 58 transition count 33
Applied a total of 258 rules in 20 ms. Remains 58 /202 variables (removed 144) and now considering 33/167 (removed 134) transitions.
// Phase 1: matrix 33 rows 58 cols
[2024-06-01 06:57:26] [INFO ] Computed 26 invariants in 0 ms
[2024-06-01 06:57:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 06:57:26] [INFO ] Invariant cache hit.
[2024-06-01 06:57:28] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned [0, 1, 2, 4, 6, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 32, 34, 36, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 1836 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/202 places, 33/167 transitions.
Graph (complete) has 67 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 26 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 24 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 24 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 19 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 18 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 18 transition count 17
Applied a total of 30 rules in 8 ms. Remains 18 /34 variables (removed 16) and now considering 17/33 (removed 16) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-06-01 06:57:28] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:57:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:57:28] [INFO ] Invariant cache hit.
[2024-06-01 06:57:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/202 places, 17/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1942 ms. Remains : 18/202 places, 17/167 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 2037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p1||X(p2)) U X(p0))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 10 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-06-01 06:57:28] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 06:57:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:57:28] [INFO ] Invariant cache hit.
[2024-06-01 06:57:28] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 06:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 242 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 3 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/403 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 408 constraints, problems are : Problem set: 0 solved, 152 unsolved in 14852 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 31/31 constraints]
After SMT, in 21890ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 21892ms
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22132 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-06 finished in 22496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 12 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-06-01 06:57:50] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 06:57:51] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 06:57:51] [INFO ] Invariant cache hit.
[2024-06-01 06:57:51] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-06-01 06:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/241 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 247 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8030 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/400 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/343 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 407 constraints, problems are : Problem set: 0 solved, 153 unsolved in 14767 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 28/28 constraints]
After SMT, in 22829ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 22830ms
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23099 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-07
Stuttering criterion allowed to conclude after 140 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-07 finished in 23288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 103 edges and 202 vertex of which 7 / 202 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 192 transition count 130
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 166 transition count 130
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 54 place count 166 transition count 92
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 83 rules applied. Total rules applied 137 place count 121 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 146 place count 112 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 155 place count 112 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 255 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 59 transition count 33
Applied a total of 257 rules in 20 ms. Remains 59 /202 variables (removed 143) and now considering 33/167 (removed 134) transitions.
// Phase 1: matrix 33 rows 59 cols
[2024-06-01 06:58:14] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 06:58:14] [INFO ] Implicit Places using invariants in 91 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/202 places, 33/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 58/202 places, 33/167 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-08 finished in 195 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)&&G(F(((p1&&X(p2))||G(p2))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 194 transition count 159
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 194 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 191 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 191 transition count 156
Applied a total of 22 rules in 18 ms. Remains 191 /202 variables (removed 11) and now considering 156/167 (removed 11) transitions.
// Phase 1: matrix 156 rows 191 cols
[2024-06-01 06:58:14] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:58:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:58:14] [INFO ] Invariant cache hit.
[2024-06-01 06:58:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-06-01 06:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 156/347 variables, 191/248 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 250 constraints, problems are : Problem set: 0 solved, 155 unsolved in 10032 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 156/347 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 155/418 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 5 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/347 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 17 (OVERLAPS) 0/347 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 426 constraints, problems are : Problem set: 0 solved, 155 unsolved in 23725 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 43/43 constraints]
After SMT, in 33786ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 33789ms
Starting structural reductions in LTL mode, iteration 1 : 191/202 places, 156/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34074 ms. Remains : 191/202 places, 156/167 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 34278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 5 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-06-01 06:58:48] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:58:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:58:48] [INFO ] Invariant cache hit.
[2024-06-01 06:58:48] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-06-01 06:58:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 154/343 variables, 189/256 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/343 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 264 constraints, problems are : Problem set: 0 solved, 153 unsolved in 10660 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/417 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 153 unsolved in 16026 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 42/42 constraints]
After SMT, in 26719ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 26725ms
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26960 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 2610 reset in 182 ms.
Product exploration explored 100000 steps with 2527 reset in 222 ms.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (533 resets) in 131 ms. (303 steps per ms) remains 1/2 properties
BEST_FIRST walk for 33104 steps (82 resets) in 51 ms. (636 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-01 06:59:17] [INFO ] Invariant cache hit.
[2024-06-01 06:59:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 06:59:17] [INFO ] Invariant cache hit.
[2024-06-01 06:59:17] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-06-01 06:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 154/343 variables, 189/256 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:25] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:25] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/343 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 264 constraints, problems are : Problem set: 0 solved, 153 unsolved in 11538 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/417 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:34] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15130 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 42/42 constraints]
After SMT, in 26698ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 26700ms
Finished structural reductions in LTL mode , in 1 iterations and 26874 ms. Remains : 189/189 places, 154/154 transitions.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 37681 steps (495 resets) in 148 ms. (252 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 323 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2654 reset in 125 ms.
Product exploration explored 100000 steps with 2613 reset in 132 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 89 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 370 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 181 transition count 145
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 25 place count 181 transition count 166
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 181 transition count 166
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 174 transition count 153
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 174 transition count 153
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 126 place count 174 transition count 153
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 157 transition count 136
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 157 transition count 136
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 160 rules in 44 ms. Remains 157 /189 variables (removed 32) and now considering 136/154 (removed 18) transitions.
[2024-06-01 06:59:46] [INFO ] Redundant transitions in 340 ms returned []
Running 135 sub problems to find dead transitions.
// Phase 1: matrix 136 rows 157 cols
[2024-06-01 06:59:46] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:59:46] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 20/57 constraints. Problems are: Problem set: 68 solved, 67 unsolved
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 15/72 constraints. Problems are: Problem set: 94 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/72 constraints. Problems are: Problem set: 94 solved, 41 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 7 (OVERLAPS) 135/292 variables, 157/229 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 7/236 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/236 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/237 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/237 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/237 constraints. Problems are: Problem set: 101 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 237 constraints, problems are : Problem set: 101 solved, 34 unsolved in 3328 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 101 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 76/146 variables, 29/29 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/30 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 35/65 constraints. Problems are: Problem set: 101 solved, 34 unsolved
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/66 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/66 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 7/153 variables, 7/73 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/73 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 135/288 variables, 153/226 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 7/233 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 34/267 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/267 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 4/292 variables, 4/271 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/271 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 1/293 variables, 1/272 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/272 constraints. Problems are: Problem set: 101 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/272 constraints. Problems are: Problem set: 101 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 272 constraints, problems are : Problem set: 101 solved, 34 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/135 constraints, Known Traps: 36/36 constraints]
After SMT, in 5581ms problems are : Problem set: 101 solved, 34 unsolved
Search for dead transitions found 101 dead transitions in 5583ms
Found 101 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 101 transitions
Dead transitions reduction (with SMT) removed 101 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 157/189 places, 35/154 transitions.
Graph (complete) has 263 edges and 157 vertex of which 71 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.0 ms
Discarding 86 places :
Also discarding 0 output transitions
Ensure Unique test removed 9 places
Applied a total of 1 rules in 4 ms. Remains 62 /157 variables (removed 95) and now considering 35/35 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/189 places, 35/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5980 ms. Remains : 62/189 places, 35/154 transitions.
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-06-01 06:59:52] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:59:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 06:59:52] [INFO ] Invariant cache hit.
[2024-06-01 06:59:52] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-06-01 06:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:56] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 154/343 variables, 189/256 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/343 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 264 constraints, problems are : Problem set: 0 solved, 153 unsolved in 9975 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/417 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
[2024-06-01 07:00:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 07:00:07] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15493 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 42/42 constraints]
After SMT, in 25499ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 25502ms
Finished structural reductions in LTL mode , in 1 iterations and 25854 ms. Remains : 189/189 places, 154/154 transitions.
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 89515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X((p0||G(p1))))||G(p2))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 195 transition count 160
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 195 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 192 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 192 transition count 157
Applied a total of 20 rules in 19 ms. Remains 192 /202 variables (removed 10) and now considering 157/167 (removed 10) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-06-01 07:00:18] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 07:00:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:00:18] [INFO ] Invariant cache hit.
[2024-06-01 07:00:18] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 07:00:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/250 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:00:23] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 252 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6923 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 156/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:00:29] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 428 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12388 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 19348ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 19350ms
Starting structural reductions in LTL mode, iteration 1 : 192/202 places, 157/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19857 ms. Remains : 192/202 places, 157/167 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11
Product exploration explored 100000 steps with 1358 reset in 222 ms.
Product exploration explored 100000 steps with 1355 reset in 301 ms.
Computed a total of 185 stabilizing places and 148 stable transitions
Graph (complete) has 382 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 185 stabilizing places and 148 stable transitions
Detected a total of 185/192 stabilizing places and 148/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (529 resets) in 267 ms. (149 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (118 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (99 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (135 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
[2024-06-01 07:00:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 56/139 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/172 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 139/311 variables, 172/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 28/339 variables, 13/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/349 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/349 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 229 constraints, problems are : Problem set: 0 solved, 4 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 56/139 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/172 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 139/311 variables, 172/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 28/339 variables, 13/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 2/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 10/349 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/349 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/349 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 245 constraints, problems are : Problem set: 1 solved, 3 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 1140ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 252 ms.
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 157/157 transitions.
Graph (trivial) has 91 edges and 192 vertex of which 6 / 192 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 375 edges and 187 vertex of which 184 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 184 transition count 124
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 162 transition count 124
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 46 place count 162 transition count 86
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 130 place count 116 transition count 86
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 64 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 64 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 63 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 63 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 62 transition count 34
Applied a total of 236 rules in 17 ms. Remains 62 /192 variables (removed 130) and now considering 34/157 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 62/192 places, 34/157 transitions.
RANDOM walk for 1094 steps (45 resets) in 15 ms. (68 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 p0 (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F p2)]
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2024-06-01 07:00:41] [INFO ] Invariant cache hit.
[2024-06-01 07:00:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:00:41] [INFO ] Invariant cache hit.
[2024-06-01 07:00:41] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 07:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/250 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 252 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6779 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:00:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 156/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:00:52] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 428 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12025 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 18821ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 18822ms
Finished structural reductions in LTL mode , in 1 iterations and 19049 ms. Remains : 192/192 places, 157/157 transitions.
Computed a total of 185 stabilizing places and 148 stable transitions
Graph (complete) has 382 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 185 stabilizing places and 148 stable transitions
Detected a total of 185/192 stabilizing places and 148/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 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))]
RANDOM walk for 40000 steps (525 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (106 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 7074 steps, run visited all 4 properties in 86 ms. (steps per millisecond=82 )
Probabilistic random walk after 7074 steps, saw 2039 distinct states, run finished after 101 ms. (steps per millisecond=70 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 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))]
Stuttering acceptance computed with spot in 159 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))]
Stuttering acceptance computed with spot in 150 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))]
Product exploration explored 100000 steps with 1357 reset in 131 ms.
Product exploration explored 100000 steps with 1361 reset in 159 ms.
Applying partial POR strategy [false, false, true, false, false]
Stuttering acceptance computed with spot in 240 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))]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Graph (trivial) has 91 edges and 192 vertex of which 6 / 192 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 376 edges and 187 vertex of which 184 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 184 transition count 148
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 24 place count 184 transition count 170
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 53 place count 184 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 177 transition count 157
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 177 transition count 157
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 128 place count 177 transition count 157
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 145 place count 160 transition count 140
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 162 place count 160 transition count 140
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 162 rules in 29 ms. Remains 160 /192 variables (removed 32) and now considering 140/157 (removed 17) transitions.
[2024-06-01 07:01:02] [INFO ] Redundant transitions in 41 ms returned []
Running 139 sub problems to find dead transitions.
// Phase 1: matrix 140 rows 160 cols
[2024-06-01 07:01:02] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 07:01:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/57 constraints. Problems are: Problem set: 69 solved, 70 unsolved
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 14/71 constraints. Problems are: Problem set: 97 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/71 constraints. Problems are: Problem set: 97 solved, 42 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 7 (OVERLAPS) 139/299 variables, 160/231 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 7/238 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/238 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/300 variables, 1/239 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/239 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/239 constraints. Problems are: Problem set: 104 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 239 constraints, problems are : Problem set: 104 solved, 35 unsolved in 3147 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 160/160 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 104 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 73/144 variables, 24/24 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/25 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 34/59 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 12/156 variables, 12/71 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 139/295 variables, 156/227 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 7/234 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 35/269 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/269 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 4/299 variables, 4/273 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/273 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 1/300 variables, 1/274 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/274 constraints. Problems are: Problem set: 104 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/300 variables, 0/274 constraints. Problems are: Problem set: 104 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 274 constraints, problems are : Problem set: 104 solved, 35 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 160/160 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 35/139 constraints, Known Traps: 34/34 constraints]
After SMT, in 5175ms problems are : Problem set: 104 solved, 35 unsolved
Search for dead transitions found 104 dead transitions in 5178ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/192 places, 36/157 transitions.
Graph (complete) has 267 edges and 160 vertex of which 72 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 places
Applied a total of 1 rules in 2 ms. Remains 62 /160 variables (removed 98) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/192 places, 36/157 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5266 ms. Remains : 62/192 places, 36/157 transitions.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-06-01 07:01:08] [INFO ] Computed 37 invariants in 8 ms
[2024-06-01 07:01:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 07:01:08] [INFO ] Invariant cache hit.
[2024-06-01 07:01:08] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 07:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 16 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/250 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 252 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6633 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 156/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 428 constraints, problems are : Problem set: 0 solved, 156 unsolved in 11923 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 18585ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 18587ms
Finished structural reductions in LTL mode , in 1 iterations and 18934 ms. Remains : 192/192 places, 157/157 transitions.
Treatment of property BusinessProcesses-PT-02-LTLFireability-11 finished in 68762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(X(p1)&&G(p2)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 6 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-06-01 07:01:27] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 242 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5668 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/403 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 408 constraints, problems are : Problem set: 0 solved, 152 unsolved in 13659 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 31/31 constraints]
After SMT, in 19347ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 19349ms
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19723 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 6 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 19922 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)||G(p1))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 5 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
[2024-06-01 07:01:46] [INFO ] Invariant cache hit.
[2024-06-01 07:01:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 07:01:47] [INFO ] Invariant cache hit.
[2024-06-01 07:01:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 07:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 242 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5852 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/403 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 408 constraints, problems are : Problem set: 0 solved, 152 unsolved in 13032 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 31/31 constraints]
After SMT, in 18913ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 18914ms
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19140 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 19233 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||G(F((!p1 U (G(!p1)||(!p1&&G((p2&&F(p3)))))))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 190 transition count 155
Applied a total of 24 rules in 5 ms. Remains 190 /202 variables (removed 12) and now considering 155/167 (removed 12) transitions.
// Phase 1: matrix 155 rows 190 cols
[2024-06-01 07:02:06] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 07:02:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 07:02:06] [INFO ] Invariant cache hit.
[2024-06-01 07:02:06] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-06-01 07:02:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:08] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/345 variables, 190/248 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 256 constraints, problems are : Problem set: 0 solved, 154 unsolved in 7145 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 29/66 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/345 variables, 190/265 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 154/419 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/345 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 426 constraints, problems are : Problem set: 0 solved, 154 unsolved in 17201 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 45/45 constraints]
After SMT, in 24363ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 24366ms
Starting structural reductions in LTL mode, iteration 1 : 190/202 places, 155/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24571 ms. Remains : 190/202 places, 155/167 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p3)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 183 stabilizing places and 146 stable transitions
Graph (complete) has 379 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 183 stabilizing places and 146 stable transitions
Detected a total of 183/190 stabilizing places and 146/155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p3))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 42 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-14 finished in 25105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-02-LTLFireability-10
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 102 edges and 202 vertex of which 7 / 202 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 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 192 transition count 130
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 166 transition count 130
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 54 place count 166 transition count 93
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 135 place count 122 transition count 93
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 143 place count 114 transition count 85
Iterating global reduction 2 with 8 rules applied. Total rules applied 151 place count 114 transition count 85
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 253 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 254 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 60 transition count 34
Applied a total of 255 rules in 22 ms. Remains 60 /202 variables (removed 142) and now considering 34/167 (removed 133) transitions.
// Phase 1: matrix 34 rows 60 cols
[2024-06-01 07:02:31] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 07:02:31] [INFO ] Implicit Places using invariants in 58 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/202 places, 34/167 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 82 ms. Remains : 59/202 places, 34/167 transitions.
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 416 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X((p0||G(p1))))||G(p2))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-02-LTLFireability-11
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 101 edges and 202 vertex of which 7 / 202 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 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 192 transition count 130
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 166 transition count 130
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 54 place count 166 transition count 92
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 138 place count 120 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 114 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 114 transition count 86
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 250 place count 63 transition count 37
Applied a total of 250 rules in 8 ms. Remains 63 /202 variables (removed 139) and now considering 37/167 (removed 130) transitions.
// Phase 1: matrix 37 rows 63 cols
[2024-06-01 07:02:31] [INFO ] Computed 27 invariants in 0 ms
[2024-06-01 07:02:32] [INFO ] Implicit Places using invariants in 80 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/202 places, 37/167 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 102 ms. Remains : 62/202 places, 37/167 transitions.
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11
Product exploration explored 100000 steps with 21729 reset in 259 ms.
Product exploration explored 100000 steps with 21735 reset in 300 ms.
Computed a total of 62 stabilizing places and 36 stable transitions
Computed a total of 62 stabilizing places and 36 stable transitions
Detected a total of 62/62 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9786 resets) in 313 ms. (127 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40000 steps (5712 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4664 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4655 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
// Phase 1: matrix 37 rows 62 cols
[2024-06-01 07:02:33] [INFO ] Computed 26 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/56 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 34/90 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/98 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 88 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/56 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 34/90 variables, 56/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/98 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/98 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 98 constraints, problems are : Problem set: 1 solved, 3 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 453ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 37/37 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 62 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 61 transition count 34
Applied a total of 5 rules in 6 ms. Remains 61 /62 variables (removed 1) and now considering 34/37 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/62 places, 34/37 transitions.
RANDOM walk for 1706 steps (71 resets) in 8 ms. (189 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 p0 (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F p2)]
Knowledge based reduction with 5 factoid took 620 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-06-01 07:02:34] [INFO ] Invariant cache hit.
[2024-06-01 07:02:34] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 07:02:34] [INFO ] Invariant cache hit.
[2024-06-01 07:02:35] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [1, 2, 4, 5, 7, 9, 12, 13, 14, 15, 16]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 118 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/62 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 51/62 places, 37/37 transitions.
Computed a total of 51 stabilizing places and 36 stable transitions
Graph (complete) has 136 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 51 stabilizing places and 36 stable transitions
Detected a total of 51/51 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 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))]
RANDOM walk for 40000 steps (9794 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4665 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4632 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4583 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4652 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 139 steps, run visited all 4 properties in 5 ms. (steps per millisecond=27 )
Probabilistic random walk after 139 steps, saw 79 distinct states, run finished after 5 ms. (steps per millisecond=27 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 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))]
Stuttering acceptance computed with spot in 196 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))]
Stuttering acceptance computed with spot in 207 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))]
Product exploration explored 100000 steps with 21809 reset in 105 ms.
Product exploration explored 100000 steps with 21811 reset in 100 ms.
Applying partial POR strategy [false, false, true, false, false]
Stuttering acceptance computed with spot in 243 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))]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 37/37 transitions.
Graph (complete) has 136 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 16 ms. Remains 49 /51 variables (removed 2) and now considering 36/37 (removed 1) transitions.
[2024-06-01 07:02:37] [INFO ] Redundant transitions in 21 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 36 rows 49 cols
[2024-06-01 07:02:37] [INFO ] Computed 14 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 35/84 variables, 49/64 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 64 constraints, problems are : Problem set: 1 solved, 31 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 2/49 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 35/84 variables, 49/64 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 31/95 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 95 constraints, problems are : Problem set: 1 solved, 31 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 31/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 929ms problems are : Problem set: 1 solved, 31 unsolved
Search for dead transitions found 1 dead transitions in 929ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/51 places, 35/37 transitions.
Graph (complete) has 131 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 48 /49 variables (removed 1) and now considering 35/35 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/51 places, 35/37 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 975 ms. Remains : 48/51 places, 35/37 transitions.
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 37/37 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 51 cols
[2024-06-01 07:02:38] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:02:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 07:02:38] [INFO ] Invariant cache hit.
[2024-06-01 07:02:38] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 07:02:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 36/87 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 67 constraints, problems are : Problem set: 0 solved, 33 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 36/87 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 100 constraints, problems are : Problem set: 0 solved, 33 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 862ms
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 51/51 places, 37/37 transitions.
Treatment of property BusinessProcesses-PT-02-LTLFireability-11 finished in 7431 ms.
[2024-06-01 07:02:39] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:02:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 167 transitions and 467 arcs took 3 ms.
Total runtime 371668 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BusinessProcesses-PT-02-LTLFireability-10
FORMULA BusinessProcesses-PT-02-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225650984

--------------------
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
mcc2024
ltl formula name BusinessProcesses-PT-02-LTLFireability-10
ltl formula formula --ltl=/tmp/3718/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 167 transitions and 467 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3718/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3718/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3718/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3718/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 203 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 203, there are 178 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~188 levels ~10000 states ~37244 transitions
pnml2lts-mc( 3/ 4): ~188 levels ~20000 states ~88084 transitions
pnml2lts-mc( 3/ 4): ~188 levels ~40000 states ~191424 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~80000 states ~432596 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~160000 states ~933768 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~320000 states ~1960020 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~640000 states ~4237108 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~1280000 states ~8979480 transitions
pnml2lts-mc( 2/ 4): ~71 levels ~2560000 states ~20133364 transitions
pnml2lts-mc( 2/ 4): ~71 levels ~5120000 states ~41430580 transitions
pnml2lts-mc( 2/ 4): ~71 levels ~10240000 states ~86816424 transitions
pnml2lts-mc( 2/ 4): ~71 levels ~20480000 states ~183872204 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22524185
pnml2lts-mc( 0/ 4): unique states count: 30187748
pnml2lts-mc( 0/ 4): unique transitions count: 276840868
pnml2lts-mc( 0/ 4): - self-loop count: 37
pnml2lts-mc( 0/ 4): - claim dead count: 244160321
pnml2lts-mc( 0/ 4): - claim found count: 2558390
pnml2lts-mc( 0/ 4): - claim success count: 30200629
pnml2lts-mc( 0/ 4): - cum. max stack depth: 541
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30201364 states 276978115 transitions, fanout: 9.171
pnml2lts-mc( 0/ 4): Total exploration time 120.520 sec (120.510 sec minimum, 120.513 sec on average)
pnml2lts-mc( 0/ 4): States per second: 250592, Transitions per second: 2298192
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 294.3MB, 10.2 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 89.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 294.3MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-02-LTLFireability-11
ltl formula formula --ltl=/tmp/3718/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 167 transitions and 467 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3718/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3718/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3718/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3718/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 203 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 203, there are 239 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~182 levels ~10000 states ~83884 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~20000 states ~174272 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~40000 states ~393556 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~80000 states ~849248 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~160000 states ~1886956 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~320000 states ~3894680 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~640000 states ~8393072 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~1280000 states ~18011496 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~2560000 states ~37079456 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~5120000 states ~79368432 transitions
pnml2lts-mc( 1/ 4): ~182 levels ~10240000 states ~171916000 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~20480000 states ~373943680 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22322054
pnml2lts-mc( 0/ 4): unique states count: 33553211
pnml2lts-mc( 0/ 4): unique transitions count: 627739703
pnml2lts-mc( 0/ 4): - self-loop count: 80
pnml2lts-mc( 0/ 4): - claim dead count: 575674419
pnml2lts-mc( 0/ 4): - claim found count: 18612903
pnml2lts-mc( 0/ 4): - claim success count: 33562797
pnml2lts-mc( 0/ 4): - cum. max stack depth: 666
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33564103 states 627978358 transitions, fanout: 18.710
pnml2lts-mc( 0/ 4): Total exploration time 169.960 sec (169.950 sec minimum, 169.952 sec on average)
pnml2lts-mc( 0/ 4): States per second: 197482, Transitions per second: 3694860
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 277.2MB, 8.7 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/33.0%
pnml2lts-mc( 0/ 4): Stored 167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 277.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
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-02, 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-171620399600460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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