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-171620398200451.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-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 47K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716302226461

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:37:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:37:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:37:08] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-21 14:37:08] [INFO ] Transformed 200 places.
[2024-05-21 14:37:08] [INFO ] Transformed 178 transitions.
[2024-05-21 14:37:08] [INFO ] Found NUPN structural information;
[2024-05-21 14:37:08] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 168 transition count 148
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 168 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 168 transition count 147
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 77 place count 152 transition count 131
Iterating global reduction 2 with 16 rules applied. Total rules applied 93 place count 152 transition count 131
Applied a total of 93 rules in 57 ms. Remains 152 /199 variables (removed 47) and now considering 131/177 (removed 46) transitions.
// Phase 1: matrix 131 rows 152 cols
[2024-05-21 14:37:08] [INFO ] Computed 28 invariants in 39 ms
[2024-05-21 14:37:08] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-21 14:37:08] [INFO ] Invariant cache hit.
[2024-05-21 14:37:09] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 14:37:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 14:37:10] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 37 ms to minimize.
[2024-05-21 14:37:11] [INFO ] Deduced a trap composed of 30 places in 1215 ms of which 2 ms to minimize.
[2024-05-21 14:37:11] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:37:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:37:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:37:12] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:37:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 30 places in 1176 ms of which 2 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-21 14:37:13] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-21 14:37:14] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-21 14:37:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:37:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:37:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 14:37:14] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:37:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 6 ms to minimize.
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 16/64 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:37:16] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 7/71 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:37:17] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-05-21 14:37:18] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 10/81 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 8 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:37:19] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 8/89 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:20] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:37:20] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 2/91 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/92 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 131/283 variables, 152/244 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:22] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:37:22] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:37:22] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:37:22] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:37:22] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 5/249 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 249 constraints, problems are : Problem set: 4 solved, 126 unsolved in 16041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 4 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 18/28 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 69/97 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-21 14:37:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-21 14:37:26] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:37:26] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/101 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 1/102 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 131/283 variables, 152/254 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 126/380 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:37:28] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:37:28] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 3/383 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/383 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:32] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/283 variables, 1/384 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:37:35] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/386 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/386 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:40] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:37:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/283 variables, 2/388 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:41] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 1/389 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/389 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:46] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/283 variables, 1/390 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:49] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:37:49] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:37:49] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 3/393 constraints. Problems are: Problem set: 4 solved, 126 unsolved
[2024-05-21 14:37:51] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/283 variables, 1/394 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/283 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 394 constraints, problems are : Problem set: 4 solved, 126 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 126/130 constraints, Known Traps: 88/88 constraints]
After SMT, in 46151ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 46170ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 152/199 places, 127/177 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 127
Applied a total of 2 rules in 9 ms. Remains 150 /152 variables (removed 2) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 150 cols
[2024-05-21 14:37:55] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 14:37:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 14:37:55] [INFO ] Invariant cache hit.
[2024-05-21 14:37:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/199 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47225 ms. Remains : 150/199 places, 127/177 transitions.
Support contains 13 out of 150 places after structural reductions.
[2024-05-21 14:37:55] [INFO ] Flatten gal took : 38 ms
[2024-05-21 14:37:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 14:37:55] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 11 out of 150 places (down from 13) after GAL structural reductions.
RANDOM walk for 10011 steps (112 resets) in 250 ms. (39 steps per ms) remains 0/7 properties
Computed a total of 127 stabilizing places and 105 stable transitions
Graph (complete) has 308 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(F(p1)))||G(F(p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 146 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 146 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 145 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 145 transition count 122
Applied a total of 10 rules in 18 ms. Remains 145 /150 variables (removed 5) and now considering 122/127 (removed 5) transitions.
// Phase 1: matrix 122 rows 145 cols
[2024-05-21 14:37:56] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 14:37:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 14:37:56] [INFO ] Invariant cache hit.
[2024-05-21 14:37:56] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-21 14:37:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:37:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:37:58] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:37:59] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:37:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/267 variables, 145/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:38:00] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:38:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:38:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:38:03] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:38:03] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:38:03] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:38:03] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/267 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/267 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 214 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8632 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/267 variables, 145/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 121/335 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:06] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2024-05-21 14:38:06] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:38:07] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:38:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:08] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:10] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:38:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:38:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 14:38:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/267 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 345 constraints, problems are : Problem set: 0 solved, 121 unsolved in 16430 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 51/51 constraints]
After SMT, in 25091ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 25095ms
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 122/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25331 ms. Remains : 145/150 places, 122/127 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-00
Stuttering criterion allowed to conclude after 115 steps with 1 reset in 3 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-00 finished in 25678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 145 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 145 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 144 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 144 transition count 121
Applied a total of 12 rules in 9 ms. Remains 144 /150 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-05-21 14:38:21] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 14:38:21] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 14:38:21] [INFO ] Invariant cache hit.
[2024-05-21 14:38:22] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-21 14:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:22] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:38:22] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:38:24] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:38:25] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:26] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:38:26] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:38:26] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:38:26] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:38:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:38:27] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:38:28] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:38:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7795 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 45/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:30] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:31] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:38:31] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 144/221 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 120/341 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:32] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:38:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:38:32] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:38:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:38:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:38:35] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:38:36] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/265 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 348 constraints, problems are : Problem set: 0 solved, 120 unsolved in 11344 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 56/56 constraints]
After SMT, in 19193ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 19211ms
Starting structural reductions in LTL mode, iteration 1 : 144/150 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19465 ms. Remains : 144/150 places, 121/127 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-02
Product exploration explored 100000 steps with 3751 reset in 439 ms.
Stack based approach found an accepted trace after 765 steps with 29 reset with depth 7 and stack size 7 in 3 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-02 finished in 20127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 127/127 transitions.
Graph (trivial) has 77 edges and 150 vertex of which 6 / 150 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 301 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 143 transition count 101
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 125 transition count 101
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 38 place count 125 transition count 72
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 102 place count 90 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 85 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 85 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 85 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 84 transition count 66
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 182 place count 49 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 48 transition count 36
Applied a total of 184 rules in 48 ms. Remains 48 /150 variables (removed 102) and now considering 36/127 (removed 91) transitions.
// Phase 1: matrix 36 rows 48 cols
[2024-05-21 14:38:42] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 14:38:42] [INFO ] Implicit Places using invariants in 81 ms returned [1, 2, 5, 6, 7, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/150 places, 36/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 42/150 places, 36/127 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-07 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 144 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 144 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 143 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 143 transition count 120
Applied a total of 14 rules in 7 ms. Remains 143 /150 variables (removed 7) and now considering 120/127 (removed 7) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 14:38:42] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 14:38:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 14:38:42] [INFO ] Invariant cache hit.
[2024-05-21 14:38:42] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 14:38:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 0 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-21 14:38:43] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:38:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:38:44] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:38:44] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-21 14:38:44] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:44] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:45] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:38:45] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:38:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:38:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:46] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:38:46] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:38:46] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 14:38:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:38:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 14:38:49] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 207 constraints, problems are : Problem set: 0 solved, 119 unsolved in 10176 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 36/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:38:53] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:53] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/210 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 119/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 14:38:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-21 14:38:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 331 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7082 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 41/41 constraints]
After SMT, in 17281ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 17283ms
Starting structural reductions in LTL mode, iteration 1 : 143/150 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17510 ms. Remains : 143/150 places, 120/127 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 120 stabilizing places and 98 stable transitions
Graph (complete) has 296 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 120 stabilizing places and 98 stable transitions
Detected a total of 120/143 stabilizing places and 98/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 33 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-12 finished in 17959 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((X(p0) U p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 145 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 145 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 144 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 144 transition count 121
Applied a total of 12 rules in 4 ms. Remains 144 /150 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-05-21 14:39:00] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 14:39:01] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-21 14:39:01] [INFO ] Invariant cache hit.
[2024-05-21 14:39:01] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-21 14:39:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:39:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 2 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:03] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/192 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:04] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-21 14:39:05] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 202 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5769 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:39:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:08] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:39:09] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:39:09] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:09] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 121/265 variables, 144/213 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 120/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:10] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:39:11] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:39:11] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:39:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-21 14:39:12] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 338 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9584 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints]
After SMT, in 15371ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15373ms
Starting structural reductions in LTL mode, iteration 1 : 144/150 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16850 ms. Remains : 144/150 places, 121/127 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 299 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/144 stabilizing places and 99/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 29 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-14 finished in 17153 ms.
All properties solved by simple procedures.
Total runtime 129342 ms.
ITS solved all properties within timeout

BK_STOP 1716302357445

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;