Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717226066381

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:28] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-01 07:14:28] [INFO ] Transformed 717 places.
[2024-06-01 07:14:28] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:28] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:28] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 105 place count 597 transition count 530
Iterating global reduction 1 with 97 rules applied. Total rules applied 202 place count 597 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 597 transition count 529
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 255 place count 545 transition count 477
Iterating global reduction 2 with 52 rules applied. Total rules applied 307 place count 545 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 544 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 544 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 310 place count 543 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 543 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 542 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 542 transition count 474
Applied a total of 313 rules in 305 ms. Remains 542 /702 variables (removed 160) and now considering 474/627 (removed 153) transitions.
// Phase 1: matrix 474 rows 542 cols
[2024-06-01 07:14:29] [INFO ] Computed 106 invariants in 25 ms
[2024-06-01 07:14:29] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 07:14:29] [INFO ] Invariant cache hit.
[2024-06-01 07:14:30] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-01 07:14:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/542 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 26 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 4 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 6 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 4 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 5 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 6 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/166 constraints. Problems are: Problem set: 9 solved, 464 unsolved
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 20/186 constraints. Problems are: Problem set: 9 solved, 464 unsolved
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
SMT process timed out in 30346ms, After SMT, problems are : Problem set: 9 solved, 464 unsolved
Search for dead transitions found 9 dead transitions in 30391ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 542/702 places, 465/627 transitions.
Applied a total of 0 rules in 26 ms. Remains 542 /542 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32370 ms. Remains : 542/702 places, 465/627 transitions.
Support contains 22 out of 542 places after structural reductions.
[2024-06-01 07:15:01] [INFO ] Flatten gal took : 68 ms
[2024-06-01 07:15:01] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:15:01] [INFO ] Input system was already deterministic with 465 transitions.
RANDOM walk for 40000 steps (204 resets) in 2219 ms. (18 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (41 resets) in 242 ms. (164 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (39 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (38 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (41 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
// Phase 1: matrix 465 rows 542 cols
[2024-06-01 07:15:02] [INFO ] Computed 106 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 119/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 263/392 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 135/527 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/530 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 457/987 variables, 530/636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/987 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 17/1004 variables, 9/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1004 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1007 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1007 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1007 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 648 constraints, problems are : Problem set: 0 solved, 5 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 119/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 263/392 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 135/527 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3/530 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 457/987 variables, 530/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/987 variables, 5/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/987 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 17/1004 variables, 9/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
Problem AtomicPropp5 is UNSAT
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1004 variables, 2/672 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1004 variables, 0/672 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/1007 variables, 3/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1007 variables, 0/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1007 variables, 0/675 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 675 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3914 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 22/22 constraints]
After SMT, in 4514ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 1671 ms.
Support contains 8 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 254 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 536 transition count 395
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 474 transition count 395
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 126 place count 474 transition count 281
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 378 place count 336 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 382 place count 332 transition count 277
Iterating global reduction 2 with 4 rules applied. Total rules applied 386 place count 332 transition count 277
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 667 place count 190 transition count 138
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 669 place count 189 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 670 place count 189 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 671 place count 188 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 672 place count 187 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 673 place count 186 transition count 139
Applied a total of 673 rules in 148 ms. Remains 186 /542 variables (removed 356) and now considering 139/465 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 186/542 places, 139/465 transitions.
RANDOM walk for 29892 steps (1414 resets) in 453 ms. (65 steps per ms) remains 0/4 properties
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 486 stabilizing places and 419 stable transitions
Graph (complete) has 1201 edges and 542 vertex of which 541 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p0)))))'
Support contains 1 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 456
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 531 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 531 transition count 454
Applied a total of 22 rules in 40 ms. Remains 531 /542 variables (removed 11) and now considering 454/465 (removed 11) transitions.
// Phase 1: matrix 454 rows 531 cols
[2024-06-01 07:15:09] [INFO ] Computed 106 invariants in 6 ms
[2024-06-01 07:15:09] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-01 07:15:09] [INFO ] Invariant cache hit.
[2024-06-01 07:15:10] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-06-01 07:15:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 5 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 97 places in 205 ms of which 5 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 14 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/985 variables, and 186 constraints, problems are : Problem set: 14 solved, 439 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 14 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 14 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 14 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 14 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 80/186 constraints. Problems are: Problem set: 14 solved, 439 unsolved
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 19 solved, 434 unsolved
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/226 constraints. Problems are: Problem set: 19 solved, 434 unsolved
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/246 constraints. Problems are: Problem set: 19 solved, 434 unsolved
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 5 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/266 constraints. Problems are: Problem set: 22 solved, 431 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/286 constraints. Problems are: Problem set: 22 solved, 431 unsolved
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 100 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/306 constraints. Problems are: Problem set: 22 solved, 431 unsolved
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 5 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 60269ms, After SMT, problems are : Problem set: 22 solved, 431 unsolved
Search for dead transitions found 22 dead transitions in 60282ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/542 places, 432/465 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61699 ms. Remains : 531/542 places, 432/465 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 62148 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((X(p0)&&F((p1||G(p2))))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 533 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 533 transition count 456
Applied a total of 18 rules in 33 ms. Remains 533 /542 variables (removed 9) and now considering 456/465 (removed 9) transitions.
// Phase 1: matrix 456 rows 533 cols
[2024-06-01 07:16:11] [INFO ] Computed 106 invariants in 8 ms
[2024-06-01 07:16:11] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 07:16:11] [INFO ] Invariant cache hit.
[2024-06-01 07:16:12] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-01 07:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/126 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 5 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 126 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 116 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/146 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/166 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 116 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/186 constraints. Problems are: Problem set: 18 solved, 437 unsolved
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 20/206 constraints. Problems are: Problem set: 18 solved, 437 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 30216ms, After SMT, problems are : Problem set: 18 solved, 437 unsolved
Search for dead transitions found 18 dead transitions in 30223ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 533/542 places, 438/465 transitions.
Applied a total of 0 rules in 10 ms. Remains 533 /533 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31125 ms. Remains : 533/542 places, 438/465 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 31324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 260 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1194 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 535 transition count 391
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 469 transition count 391
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 469 transition count 277
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 330 transition count 277
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 392 place count 325 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 397 place count 325 transition count 272
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 686 place count 179 transition count 129
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 688 place count 178 transition count 132
Applied a total of 688 rules in 61 ms. Remains 178 /542 variables (removed 364) and now considering 132/465 (removed 333) transitions.
// Phase 1: matrix 132 rows 178 cols
[2024-06-01 07:16:42] [INFO ] Computed 78 invariants in 2 ms
[2024-06-01 07:16:42] [INFO ] Implicit Places using invariants in 166 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 170 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/542 places, 132/465 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 150/542 places, 132/465 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 13725 reset in 378 ms.
Stack based approach found an accepted trace after 3276 steps with 447 reset with depth 26 and stack size 17 in 16 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-08 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 261 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1194 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 392
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 392
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 132 place count 470 transition count 277
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 387 place count 330 transition count 277
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 394 place count 323 transition count 270
Iterating global reduction 2 with 7 rules applied. Total rules applied 401 place count 323 transition count 270
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 684 place count 180 transition count 130
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 686 place count 179 transition count 133
Applied a total of 686 rules in 44 ms. Remains 179 /542 variables (removed 363) and now considering 133/465 (removed 332) transitions.
// Phase 1: matrix 133 rows 179 cols
[2024-06-01 07:16:43] [INFO ] Computed 78 invariants in 3 ms
[2024-06-01 07:16:43] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 163 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/542 places, 133/465 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 151/542 places, 133/465 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-10
Product exploration explored 100000 steps with 11270 reset in 231 ms.
Product exploration explored 100000 steps with 11362 reset in 234 ms.
Computed a total of 129 stabilizing places and 116 stable transitions
Computed a total of 129 stabilizing places and 116 stable transitions
Detected a total of 129/151 stabilizing places and 116/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5290 resets) in 2064 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2443 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 544 steps, run visited all 1 properties in 15 ms. (steps per millisecond=36 )
Probabilistic random walk after 544 steps, saw 209 distinct states, run finished after 21 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 151 cols
[2024-06-01 07:16:44] [INFO ] Computed 50 invariants in 1 ms
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:16:45] [INFO ] Invariant cache hit.
[2024-06-01 07:16:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [3, 36, 37, 52, 54, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 133, 135, 137]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 332 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/151 places, 133/133 transitions.
Graph (complete) has 389 edges and 124 vertex of which 117 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 117 transition count 118
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 105 transition count 118
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 97 transition count 101
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 97 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 97 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 94 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 50 place count 91 transition count 95
Iterating global reduction 4 with 3 rules applied. Total rules applied 53 place count 91 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 55 place count 91 transition count 93
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 65 place count 86 transition count 88
Applied a total of 65 rules in 14 ms. Remains 86 /124 variables (removed 38) and now considering 88/133 (removed 45) transitions.
// Phase 1: matrix 88 rows 86 cols
[2024-06-01 07:16:45] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 07:16:45] [INFO ] Invariant cache hit.
[2024-06-01 07:16:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 212 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/151 places, 88/133 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 571 ms. Remains : 85/151 places, 88/133 transitions.
Computed a total of 63 stabilizing places and 71 stable transitions
Graph (complete) has 285 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 71 stable transitions
Detected a total of 63/85 stabilizing places and 71/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5434 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2390 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 213 steps, run visited all 1 properties in 5 ms. (steps per millisecond=42 )
Probabilistic random walk after 213 steps, saw 94 distinct states, run finished after 6 ms. (steps per millisecond=35 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11470 reset in 156 ms.
Product exploration explored 100000 steps with 11437 reset in 200 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 88/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 85 cols
[2024-06-01 07:16:46] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:16:46] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 07:16:46] [INFO ] Invariant cache hit.
[2024-06-01 07:16:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:16:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-06-01 07:16:46] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-01 07:16:46] [INFO ] Invariant cache hit.
[2024-06-01 07:16:46] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/39 constraints. Problems are: Problem set: 8 solved, 76 unsolved
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 9/48 constraints. Problems are: Problem set: 8 solved, 76 unsolved
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 7/55 constraints. Problems are: Problem set: 8 solved, 76 unsolved
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/59 constraints. Problems are: Problem set: 8 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/59 constraints. Problems are: Problem set: 8 solved, 76 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 9 (OVERLAPS) 87/172 variables, 85/144 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/147 constraints. Problems are: Problem set: 15 solved, 69 unsolved
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 8/155 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/155 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/172 variables, 0/155 constraints. Problems are: Problem set: 15 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/173 variables, and 155 constraints, problems are : Problem set: 15 solved, 69 unsolved in 4672 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 15 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/26 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 13/39 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 28/67 constraints. Problems are: Problem set: 15 solved, 69 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/68 constraints. Problems are: Problem set: 15 solved, 69 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 5/73 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/73 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 87/172 variables, 85/158 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/161 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 69/230 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/230 constraints. Problems are: Problem set: 15 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/172 variables, 0/230 constraints. Problems are: Problem set: 15 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/173 variables, and 230 constraints, problems are : Problem set: 15 solved, 69 unsolved in 3192 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 69/84 constraints, Known Traps: 54/54 constraints]
After SMT, in 7912ms problems are : Problem set: 15 solved, 69 unsolved
Search for dead transitions found 15 dead transitions in 7914ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 85/85 places, 73/88 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 83 /85 variables (removed 2) and now considering 73/73 (removed 0) transitions.
[2024-06-01 07:16:54] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 8191 ms. Remains : 83/85 places, 73/88 transitions.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-10 finished in 11328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(!p1)))))'
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Graph (trivial) has 259 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1194 edges and 537 vertex of which 536 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 392
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 392
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 132 place count 470 transition count 278
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 384 place count 332 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 326 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 326 transition count 272
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 681 place count 182 transition count 131
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 683 place count 181 transition count 134
Applied a total of 683 rules in 41 ms. Remains 181 /542 variables (removed 361) and now considering 134/465 (removed 331) transitions.
// Phase 1: matrix 134 rows 181 cols
[2024-06-01 07:16:54] [INFO ] Computed 79 invariants in 1 ms
[2024-06-01 07:16:54] [INFO ] Implicit Places using invariants in 157 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 160 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/542 places, 134/465 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 152/542 places, 134/465 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 216 steps with 32 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-12 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((p1 U p2))||p0)))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 465/465 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 534 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 534 transition count 457
Applied a total of 16 rules in 25 ms. Remains 534 /542 variables (removed 8) and now considering 457/465 (removed 8) transitions.
// Phase 1: matrix 457 rows 534 cols
[2024-06-01 07:16:54] [INFO ] Computed 106 invariants in 4 ms
[2024-06-01 07:16:55] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:16:55] [INFO ] Invariant cache hit.
[2024-06-01 07:16:55] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2024-06-01 07:16:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 66/104 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 7 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/186 constraints. Problems are: Problem set: 10 solved, 446 unsolved
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/206 constraints. Problems are: Problem set: 18 solved, 438 unsolved
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 18 solved, 438 unsolved
Search for dead transitions found 18 dead transitions in 30152ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 534/542 places, 439/465 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 533 transition count 439
Applied a total of 1 rules in 12 ms. Remains 533 /534 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 533 cols
[2024-06-01 07:17:25] [INFO ] Computed 108 invariants in 7 ms
[2024-06-01 07:17:25] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 07:17:25] [INFO ] Invariant cache hit.
[2024-06-01 07:17:26] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 770 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 532/542 places, 439/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31719 ms. Remains : 532/542 places, 439/465 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 228 ms.
Product exploration explored 100000 steps with 33333 reset in 196 ms.
Computed a total of 477 stabilizing places and 394 stable transitions
Graph (complete) has 1141 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Computed a total of 477 stabilizing places and 394 stable transitions
Detected a total of 477/532 stabilizing places and 394/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-14 finished in 32402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 07:17:27] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:17:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:17:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 542 places, 465 transitions and 1459 arcs took 8 ms.
Total runtime 179446 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226248218

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-18-LTLCardinality-10
ltl formula formula --ltl=/tmp/2562/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 542 places, 465 transitions and 1459 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2562/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2562/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2562/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2562/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 543 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 543, there are 477 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~392 levels ~10000 states ~51532 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~997!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10351
pnml2lts-mc( 0/ 4): unique states count: 12784
pnml2lts-mc( 0/ 4): unique transitions count: 51632
pnml2lts-mc( 0/ 4): - self-loop count: 175
pnml2lts-mc( 0/ 4): - claim dead count: 30778
pnml2lts-mc( 0/ 4): - claim found count: 476
pnml2lts-mc( 0/ 4): - claim success count: 12795
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2336
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12795 states 51658 transitions, fanout: 4.037
pnml2lts-mc( 0/ 4): Total exploration time 0.250 sec (0.250 sec minimum, 0.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51180, Transitions per second: 206632
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 19.1 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 470 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-18, 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 r472-tajo-171620399800587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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