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.r047-tajo-171620398400508.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 greatspnxred
Input is BusinessProcesses-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K 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-08-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716304390393

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:13:11] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 15:13:11] [INFO ] Transformed 393 places.
[2024-05-21 15:13:11] [INFO ] Transformed 344 transitions.
[2024-05-21 15:13:11] [INFO ] Found NUPN structural information;
[2024-05-21 15:13:11] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 196 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 4 formulas.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 69 place count 311 transition count 270
Iterating global reduction 1 with 61 rules applied. Total rules applied 130 place count 311 transition count 270
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 160 place count 281 transition count 240
Iterating global reduction 1 with 30 rules applied. Total rules applied 190 place count 281 transition count 240
Applied a total of 190 rules in 107 ms. Remains 281 /380 variables (removed 99) and now considering 240/331 (removed 91) transitions.
// Phase 1: matrix 240 rows 281 cols
[2024-05-21 15:13:12] [INFO ] Computed 50 invariants in 20 ms
[2024-05-21 15:13:12] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 15:13:12] [INFO ] Invariant cache hit.
[2024-05-21 15:13:12] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-21 15:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:15] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 30 ms to minimize.
[2024-05-21 15:13:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:13:16] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 4 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 3 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:13:17] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 3 ms to minimize.
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:13:18] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:13:19] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 5 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:13:21] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:13:22] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:13:22] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:13:22] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:13:22] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:23] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-05-21 15:13:23] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:13:23] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 240/521 variables, 281/379 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:26] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:13:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 15:13:27] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 3 ms to minimize.
[2024-05-21 15:13:27] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 3 ms to minimize.
[2024-05-21 15:13:27] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:13:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:13:28] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:13:28] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:30] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (OVERLAPS) 0/521 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 388 constraints, problems are : Problem set: 0 solved, 239 unsolved in 23691 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 57/107 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/521 variables, 281/388 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 239/627 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:13:41] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:13:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:13:43] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:13:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 11/638 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 15:13:55] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 640 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 70/70 constraints]
After SMT, in 53851ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 53874ms
Starting structural reductions in LTL mode, iteration 1 : 281/380 places, 240/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54679 ms. Remains : 281/380 places, 240/331 transitions.
Support contains 30 out of 281 places after structural reductions.
[2024-05-21 15:14:07] [INFO ] Flatten gal took : 52 ms
[2024-05-21 15:14:07] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:14:07] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 28 out of 281 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (340 resets) in 1890 ms. (21 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40003 steps (57 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 132 ms. (300 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 137 ms. (289 steps per ms) remains 2/4 properties
[2024-05-21 15:14:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 165/252 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 213/465 variables, 252/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/507 variables, 19/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/521 variables, 10/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/521 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 84/87 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/252 variables, 34/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 13 places in 876 ms of which 28 ms to minimize.
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:14:09] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 6/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 213/465 variables, 252/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 2/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/507 variables, 19/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 1/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:14:10] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 4/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/521 variables, 10/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/521 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 344 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 2993ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 125 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 97 stabilizing places and 93 stable transitions
Graph (complete) has 595 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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))||G(p1))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 260 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 260 transition count 218
Applied a total of 43 rules in 50 ms. Remains 260 /281 variables (removed 21) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 260 cols
[2024-05-21 15:14:11] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 15:14:11] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 15:14:11] [INFO ] Invariant cache hit.
[2024-05-21 15:14:12] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-21 15:14:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:14:14] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:14:15] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:14:16] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:14:16] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:14:16] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:14:16] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:14:16] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:14:17] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:14:17] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:14:17] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:14:17] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:14:18] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-21 15:14:18] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:14:18] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/334 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:14:21] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:14:21] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 3 ms to minimize.
[2024-05-21 15:14:21] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:14:21] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:14:21] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:14:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:14:22] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 341 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15907 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:14:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/478 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 566 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 39/39 constraints]
After SMT, in 45958ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45962ms
Starting structural reductions in LTL mode, iteration 1 : 260/281 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46450 ms. Remains : 260/281 places, 218/240 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 1317 reset in 344 ms.
Stack based approach found an accepted trace after 422 steps with 5 reset with depth 31 and stack size 31 in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-00 finished in 47162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 225
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 266 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 259 transition count 217
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 259 transition count 217
Applied a total of 45 rules in 19 ms. Remains 259 /281 variables (removed 22) and now considering 217/240 (removed 23) transitions.
// Phase 1: matrix 217 rows 259 cols
[2024-05-21 15:14:58] [INFO ] Computed 50 invariants in 7 ms
[2024-05-21 15:14:58] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 15:14:58] [INFO ] Invariant cache hit.
[2024-05-21 15:14:59] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-21 15:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 3 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 3 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:15:02] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:15:03] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:15:03] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:15:03] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:15:03] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:03] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 3 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/334 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:09] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 3 ms to minimize.
[2024-05-21 15:15:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:15:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 342 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17208 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/558 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
[2024-05-21 15:15:20] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:15:20] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:15:21] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:15:21] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:26] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 15:15:37] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/476 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 565 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 40/40 constraints]
After SMT, in 47325ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 47328ms
Starting structural reductions in LTL mode, iteration 1 : 259/281 places, 217/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47778 ms. Remains : 259/281 places, 217/240 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-01 finished in 47990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 268 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 262 transition count 220
Applied a total of 39 rules in 22 ms. Remains 262 /281 variables (removed 19) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 262 cols
[2024-05-21 15:15:46] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 15:15:46] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 15:15:46] [INFO ] Invariant cache hit.
[2024-05-21 15:15:47] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 15:15:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:15:50] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:15:50] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:15:50] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:15:50] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:15:50] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:15:51] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:15:52] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:15:53] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:15:53] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:15:53] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/482 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:15:56] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:15:56] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:15:56] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:15:56] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:15:57] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:15:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:15:57] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:15:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:15:57] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 9/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 344 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15388 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/482 variables, 262/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 219/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:16:05] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:16:06] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:16:06] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:16:07] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:16:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 568 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20960 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 37/37 constraints]
After SMT, in 36394ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 36397ms
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37037 ms. Remains : 262/281 places, 220/240 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-04 finished in 37260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||X(p1)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 261 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 261 transition count 219
Applied a total of 41 rules in 18 ms. Remains 261 /281 variables (removed 20) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-21 15:16:23] [INFO ] Computed 50 invariants in 4 ms
[2024-05-21 15:16:24] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 15:16:24] [INFO ] Invariant cache hit.
[2024-05-21 15:16:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 15:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:16:26] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:16:27] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:16:28] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:16:28] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:28] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:16:28] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:16:29] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/334 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:31] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:16:31] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-21 15:16:31] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:16:31] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 4 ms to minimize.
[2024-05-21 15:16:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:16:32] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:16:32] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:16:32] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:16:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:16:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/480 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 344 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13465 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:39] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:16:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/346 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 218/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:41] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:16:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:16:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:17:05] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
[2024-05-21 15:17:05] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/480 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 570 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 41/41 constraints]
After SMT, in 43522ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 43525ms
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43879 ms. Remains : 261/281 places, 219/240 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 2839 reset in 241 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-07 finished in 44303 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((F(p0)&&X(G(p1))))) U (X(X(p2))||G(p3))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 268 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 262 transition count 220
Applied a total of 39 rules in 11 ms. Remains 262 /281 variables (removed 19) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 262 cols
[2024-05-21 15:17:08] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 15:17:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 15:17:08] [INFO ] Invariant cache hit.
[2024-05-21 15:17:08] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 15:17:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:17:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:17:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:17:12] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:17:13] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:17:13] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/482 variables, 262/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:17:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:17:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:17:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:17:16] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:17:17] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 11/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 348 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12780 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/482 variables, 262/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 219/567 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:17:24] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:17:25] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:17:25] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:17:26] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 15:17:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:32] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:38] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:17:38] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:17:39] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 15:17:44] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 578 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 47/47 constraints]
After SMT, in 42837ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 42841ms
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43149 ms. Remains : 262/281 places, 220/240 transitions.
Stuttering acceptance computed with spot in 875 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3) p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 2485 reset in 185 ms.
Stack based approach found an accepted trace after 856 steps with 18 reset with depth 9 and stack size 9 in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-08 finished in 44246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 151 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 587 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 273 transition count 194
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 194
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 74 place count 237 transition count 139
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 195 place count 171 transition count 139
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 208 place count 158 transition count 126
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 222 place count 157 transition count 126
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 376 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 378 place count 77 transition count 49
Applied a total of 378 rules in 61 ms. Remains 77 /281 variables (removed 204) and now considering 49/240 (removed 191) transitions.
// Phase 1: matrix 49 rows 77 cols
[2024-05-21 15:17:52] [INFO ] Computed 35 invariants in 0 ms
[2024-05-21 15:17:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 15:17:52] [INFO ] Invariant cache hit.
[2024-05-21 15:17:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 213 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/281 places, 49/240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 39 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 26 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 26 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 26 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 23 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 19 transition count 28
Applied a total of 41 rules in 12 ms. Remains 19 /39 variables (removed 20) and now considering 28/49 (removed 21) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-05-21 15:17:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:17:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 15:17:52] [INFO ] Invariant cache hit.
[2024-05-21 15:17:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/281 places, 28/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 19/281 places, 28/240 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 23341 reset in 161 ms.
Product exploration explored 100000 steps with 23243 reset in 118 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Computed a total of 5 stabilizing places and 9 stable transitions
Detected a total of 5/19 stabilizing places and 9/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 45 steps (15 resets) in 5 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 15:17:54] [INFO ] Invariant cache hit.
[2024-05-21 15:17:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 15:17:54] [INFO ] Invariant cache hit.
[2024-05-21 15:17:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 15:17:54] [INFO ] Redundant transitions in 31 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-21 15:17:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 19 constraints, problems are : Problem set: 0 solved, 25 unsolved in 175 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 44 constraints, problems are : Problem set: 0 solved, 25 unsolved in 198 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 19/19 places, 28/28 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Computed a total of 5 stabilizing places and 9 stable transitions
Detected a total of 5/19 stabilizing places and 9/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 50 steps (16 resets) in 5 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 23251 reset in 122 ms.
Product exploration explored 100000 steps with 23322 reset in 160 ms.
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 15:17:55] [INFO ] Invariant cache hit.
[2024-05-21 15:17:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 15:17:55] [INFO ] Invariant cache hit.
[2024-05-21 15:17:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 15:17:55] [INFO ] Redundant transitions in 34 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-21 15:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 19 constraints, problems are : Problem set: 0 solved, 25 unsolved in 185 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/45 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 44 constraints, problems are : Problem set: 0 solved, 25 unsolved in 245 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 438ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 570 ms. Remains : 19/19 places, 28/28 transitions.
Treatment of property BusinessProcesses-PT-08-LTLFireability-09 finished in 3815 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 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 149 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 587 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 273 transition count 195
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 238 transition count 195
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 72 place count 238 transition count 141
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 191 place count 173 transition count 141
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 204 place count 160 transition count 128
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 218 place count 159 transition count 128
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 372 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 79 transition count 51
Applied a total of 374 rules in 31 ms. Remains 79 /281 variables (removed 202) and now considering 51/240 (removed 189) transitions.
// Phase 1: matrix 51 rows 79 cols
[2024-05-21 15:17:56] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 15:17:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 15:17:56] [INFO ] Invariant cache hit.
[2024-05-21 15:17:56] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 15, 17, 19, 21, 25, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 212 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/281 places, 51/240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 30 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 30 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 30 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 27 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 24 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 24 transition count 31
Applied a total of 39 rules in 9 ms. Remains 24 /43 variables (removed 19) and now considering 31/51 (removed 20) transitions.
// Phase 1: matrix 31 rows 24 cols
[2024-05-21 15:17:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 15:17:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 15:17:56] [INFO ] Invariant cache hit.
[2024-05-21 15:17:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/281 places, 31/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 24/281 places, 31/240 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-11 finished in 395 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 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 225
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 266 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 260 transition count 218
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 260 transition count 218
Applied a total of 43 rules in 35 ms. Remains 260 /281 variables (removed 21) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 260 cols
[2024-05-21 15:17:56] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 15:17:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 15:17:56] [INFO ] Invariant cache hit.
[2024-05-21 15:17:57] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-21 15:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:17:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:17:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:18:00] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:18:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:18:01] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/332 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:18:04] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:18:04] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:18:04] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:18:04] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:18:04] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:18:05] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:18:05] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:18:05] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:18:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 9/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 341 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12763 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-21 15:18:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:18:14] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:18:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:18:14] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:18:15] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:18:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 564 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20773 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 37/37 constraints]
After SMT, in 33581ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 33585ms
Starting structural reductions in LTL mode, iteration 1 : 260/281 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33961 ms. Remains : 260/281 places, 218/240 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-12 finished in 34113 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 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (complete) has 595 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 279 transition count 205
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 246 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 244 transition count 203
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 71 place count 244 transition count 144
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 200 place count 174 transition count 144
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 215 place count 159 transition count 129
Ensure Unique test removed 1 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 231 place count 158 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 233 place count 158 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 234 place count 157 transition count 127
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 386 place count 80 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 387 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 389 place count 78 transition count 50
Applied a total of 389 rules in 35 ms. Remains 78 /281 variables (removed 203) and now considering 50/240 (removed 190) transitions.
// Phase 1: matrix 50 rows 78 cols
[2024-05-21 15:18:30] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 15:18:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:18:30] [INFO ] Invariant cache hit.
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [14, 15, 17, 19, 21, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 202 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/281 places, 50/240 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 43
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 45 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 39 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 39 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 39 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 36 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 33 transition count 31
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 33 transition count 31
Applied a total of 40 rules in 6 ms. Remains 33 /52 variables (removed 19) and now considering 31/50 (removed 19) transitions.
// Phase 1: matrix 31 rows 33 cols
[2024-05-21 15:18:31] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 15:18:31] [INFO ] Invariant cache hit.
[2024-05-21 15:18:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 129 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/281 places, 31/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 373 ms. Remains : 23/281 places, 31/240 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-13 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 150 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 587 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 273 transition count 194
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 194
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 74 place count 237 transition count 139
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 195 place count 171 transition count 139
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 207 place count 159 transition count 127
Ensure Unique test removed 1 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 220 place count 158 transition count 127
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 374 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 78 transition count 50
Applied a total of 376 rules in 20 ms. Remains 78 /281 variables (removed 203) and now considering 50/240 (removed 190) transitions.
// Phase 1: matrix 50 rows 78 cols
[2024-05-21 15:18:31] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-21 15:18:31] [INFO ] Invariant cache hit.
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 433 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/281 places, 50/240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 43
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 33 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 27 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 27 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 27 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 24 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 21 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 21 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 21 transition count 30
Applied a total of 41 rules in 4 ms. Remains 21 /40 variables (removed 19) and now considering 30/50 (removed 20) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-21 15:18:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 15:18:31] [INFO ] Invariant cache hit.
[2024-05-21 15:18:31] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/281 places, 30/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 592 ms. Remains : 21/281 places, 30/240 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-14 finished in 712 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)&&((p1&&X(!p0)) U (p1&&X(!p0)&&(G(p2)||G(p1))))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 268 transition count 226
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 261 transition count 219
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 261 transition count 219
Applied a total of 41 rules in 33 ms. Remains 261 /281 variables (removed 20) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-21 15:18:32] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 15:18:32] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 15:18:32] [INFO ] Invariant cache hit.
[2024-05-21 15:18:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 15:18:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:18:37] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-21 15:18:37] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:38] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:18:38] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:41] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:18:41] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:18:42] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:18:42] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:18:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:18:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 3 ms to minimize.
[2024-05-21 15:18:42] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:18:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 348 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14926 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 37/87 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:49] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/350 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 218/568 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:18:55] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:18:58] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:19:11] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/480 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 15:19:16] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 573 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 44/44 constraints]
After SMT, in 44981ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44985ms
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45416 ms. Remains : 261/281 places, 219/240 transitions.
Stuttering acceptance computed with spot in 522 ms :[true, true, p0, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (NOT p2), false, (NOT p1), false]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 151 steps with 1 reset in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-15 finished in 45964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-05-21 15:19:18] [INFO ] Flatten gal took : 36 ms
[2024-05-21 15:19:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:19:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 281 places, 240 transitions and 695 arcs took 8 ms.
Total runtime 366561 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 281
TRANSITIONS: 240
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2260
MODEL NAME: /home/mcc/execution/419/model
281 places, 240 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-08-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716305557224

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-08, 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 r047-tajo-171620398400508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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