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.r048-tajo-171620399800564.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 itstools
Input is BusinessProcesses-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716336439517

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:07:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:07:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:07:21] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-22 00:07:21] [INFO ] Transformed 630 places.
[2024-05-22 00:07:21] [INFO ] Transformed 566 transitions.
[2024-05-22 00:07:21] [INFO ] Found NUPN structural information;
[2024-05-22 00:07:21] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 84 place count 542 transition count 481
Iterating global reduction 1 with 81 rules applied. Total rules applied 165 place count 542 transition count 481
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 205 place count 502 transition count 441
Iterating global reduction 1 with 40 rules applied. Total rules applied 245 place count 502 transition count 441
Applied a total of 245 rules in 135 ms. Remains 502 /626 variables (removed 124) and now considering 441/562 (removed 121) transitions.
// Phase 1: matrix 441 rows 502 cols
[2024-05-22 00:07:21] [INFO ] Computed 99 invariants in 31 ms
[2024-05-22 00:07:21] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-22 00:07:21] [INFO ] Invariant cache hit.
[2024-05-22 00:07:22] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-05-22 00:07:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/94 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 00:07:32] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 40 ms to minimize.
[2024-05-22 00:07:32] [INFO ] Deduced a trap composed of 75 places in 254 ms of which 2 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 76 places in 383 ms of which 2 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 75 places in 725 ms of which 10 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 74 places in 411 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 2 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 98 places in 250 ms of which 2 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 97 places in 606 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 8 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 11 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/139 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 9 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/159 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 105 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 4 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/179 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 117 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
SMT process timed out in 30329ms, After SMT, problems are : Problem set: 25 solved, 415 unsolved
Search for dead transitions found 25 dead transitions in 30356ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/626 places, 416/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31583 ms. Remains : 502/626 places, 416/562 transitions.
Support contains 39 out of 502 places after structural reductions.
[2024-05-22 00:07:53] [INFO ] Flatten gal took : 65 ms
[2024-05-22 00:07:53] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:07:53] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 37 out of 502 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (268 resets) in 1745 ms. (22 steps per ms) remains 20/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 109 ms. (36 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
// Phase 1: matrix 416 rows 502 cols
[2024-05-22 00:07:54] [INFO ] Computed 100 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 129/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 222/378 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 118/496 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 7 (OVERLAPS) 412/908 variables, 496/596 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-22 00:07:54] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:54] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:07:54] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/908 variables, 11/607 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
SMT process timed out in 5067ms, After SMT, problems are : Problem set: 2 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 220 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 3 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 1070 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 496 transition count 353
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 441 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 440 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 114 place count 440 transition count 257
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 322 place count 327 transition count 257
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 327 place count 322 transition count 252
Iterating global reduction 3 with 5 rules applied. Total rules applied 332 place count 322 transition count 252
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 579 place count 196 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 581 place count 195 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 583 place count 195 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 585 place count 193 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 586 place count 193 transition count 133
Applied a total of 586 rules in 93 ms. Remains 193 /502 variables (removed 309) and now considering 133/416 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 193/502 places, 133/416 transitions.
RANDOM walk for 40000 steps (955 resets) in 1226 ms. (32 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (491 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (467 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
// Phase 1: matrix 133 rows 193 cols
[2024-05-22 00:07:59] [INFO ] Computed 77 invariants in 2 ms
[2024-05-22 00:07:59] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/159 variables, 56/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/191 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 133/324 variables, 191/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 13 (OVERLAPS) 2/326 variables, 2/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 307 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 193/193 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 98/158 variables, 56/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/191 variables, 17/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 20/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 133/324 variables, 191/293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 12/305 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/326 variables, 2/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/326 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 309 constraints, problems are : Problem set: 1 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 193/193 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 1940ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 4 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 216 stabilizing places and 188 stable transitions
Graph (complete) has 1077 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 241 edges and 502 vertex of which 6 / 502 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 1071 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 496 transition count 348
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 435 transition count 348
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 435 transition count 246
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 313 transition count 246
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 362 place count 299 transition count 232
Iterating global reduction 2 with 14 rules applied. Total rules applied 376 place count 299 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 376 place count 299 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 297 transition count 230
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 631 place count 169 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 633 place count 168 transition count 111
Applied a total of 633 rules in 67 ms. Remains 168 /502 variables (removed 334) and now considering 111/416 (removed 305) transitions.
// Phase 1: matrix 111 rows 168 cols
[2024-05-22 00:08:02] [INFO ] Computed 75 invariants in 2 ms
[2024-05-22 00:08:02] [INFO ] Implicit Places using invariants in 138 ms returned [2, 3, 4, 5, 6, 9, 10, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 140 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/502 places, 111/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 146/502 places, 111/416 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 400
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 398
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 398
Applied a total of 36 rules in 93 ms. Remains 484 /502 variables (removed 18) and now considering 398/416 (removed 18) transitions.
// Phase 1: matrix 398 rows 484 cols
[2024-05-22 00:08:02] [INFO ] Computed 100 invariants in 10 ms
[2024-05-22 00:08:02] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 00:08:02] [INFO ] Invariant cache hit.
[2024-05-22 00:08:03] [INFO ] Implicit Places using invariants and state equation in 575 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 805 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 398/416 transitions.
Applied a total of 0 rules in 8 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 481/502 places, 398/416 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 400
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 398
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 398
Applied a total of 36 rules in 22 ms. Remains 484 /502 variables (removed 18) and now considering 398/416 (removed 18) transitions.
[2024-05-22 00:08:03] [INFO ] Invariant cache hit.
[2024-05-22 00:08:03] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 00:08:03] [INFO ] Invariant cache hit.
[2024-05-22 00:08:04] [INFO ] Implicit Places using invariants and state equation in 529 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 723 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 398/416 transitions.
Applied a total of 0 rules in 12 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 481/502 places, 398/416 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 673 reset in 287 ms.
Product exploration explored 100000 steps with 676 reset in 257 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1037 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/398 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 171 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (269 resets) in 405 ms. (98 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (49 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
// Phase 1: matrix 398 rows 481 cols
[2024-05-22 00:08:05] [INFO ] Computed 97 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 321/354 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/467 variables, 36/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/475 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 394/869 variables, 475/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/878 variables, 5/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/878 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/879 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/879 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/879 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/879 variables, and 578 constraints, problems are : Problem set: 0 solved, 2 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/354 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 3/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/467 variables, 36/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 6 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 90 places in 273 ms of which 6 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 5 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:08:10] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 5655ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 398/398 transitions.
Graph (trivial) has 222 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 1 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 1030 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 475 transition count 340
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 425 transition count 340
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 425 transition count 237
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 302 transition count 237
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 591 place count 168 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 593 place count 167 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 167 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 597 place count 165 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 165 transition count 110
Applied a total of 598 rules in 51 ms. Remains 165 /481 variables (removed 316) and now considering 110/398 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 165/481 places, 110/398 transitions.
RANDOM walk for 3639 steps (107 resets) in 16 ms. (214 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 398/398 transitions.
Graph (trivial) has 221 edges and 481 vertex of which 6 / 481 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 1031 edges and 476 vertex of which 475 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 474 transition count 340
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 424 transition count 340
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 424 transition count 237
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 301 transition count 237
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 585 place count 170 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 587 place count 169 transition count 115
Applied a total of 587 rules in 37 ms. Remains 169 /481 variables (removed 312) and now considering 115/398 (removed 283) transitions.
// Phase 1: matrix 115 rows 169 cols
[2024-05-22 00:08:11] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:08:11] [INFO ] Implicit Places using invariants in 93 ms returned [1, 2, 3, 4, 5, 8, 9, 29, 30, 31, 32, 37, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 95 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/481 places, 115/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 147/481 places, 115/398 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/147 stabilizing places and 25/115 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5664 resets) in 856 ms. (46 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (2007 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2082 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
// Phase 1: matrix 115 rows 147 cols
[2024-05-22 00:08:12] [INFO ] Computed 50 invariants in 1 ms
[2024-05-22 00:08:12] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/75 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/113 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/141 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/145 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/259 variables, 145/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/261 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/261 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 147/147 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/75 variables, 33/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/113 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/141 variables, 12/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 17/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/145 variables, 3/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 114/259 variables, 145/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 5/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/261 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/261 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 221 constraints, problems are : Problem set: 1 solved, 1 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 147/147 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 1063ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 115/115 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 145 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 145 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 143 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 143 transition count 110
Applied a total of 10 rules in 13 ms. Remains 143 /147 variables (removed 4) and now considering 110/115 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 143/147 places, 110/115 transitions.
RANDOM walk for 2978 steps (89 resets) in 8 ms. (330 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13152 reset in 226 ms.
Product exploration explored 100000 steps with 13090 reset in 194 ms.
Built C files in :
/tmp/ltsmin12506407208594348970
[2024-05-22 00:08:14] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-22 00:08:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:14] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-22 00:08:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:14] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-22 00:08:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:14] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12506407208594348970
Running compilation step : cd /tmp/ltsmin12506407208594348970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin12506407208594348970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin12506407208594348970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4839313509148765425.hoa' '--buchi-type=spotba'
LTSmin run took 594 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 12248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 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 1071 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 348
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 435 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 434 transition count 347
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 246
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 345 place count 314 transition count 246
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 359 place count 300 transition count 232
Iterating global reduction 3 with 14 rules applied. Total rules applied 373 place count 300 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 373 place count 300 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 298 transition count 230
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 628 place count 170 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 630 place count 169 transition count 111
Applied a total of 630 rules in 39 ms. Remains 169 /502 variables (removed 333) and now considering 111/416 (removed 305) transitions.
// Phase 1: matrix 111 rows 169 cols
[2024-05-22 00:08:15] [INFO ] Computed 76 invariants in 1 ms
[2024-05-22 00:08:15] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54, 136]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 133 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/502 places, 111/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 146/502 places, 111/416 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-05 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X(p2)&&G(p3))))'
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 402
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 402
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 400
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 400
Applied a total of 32 rules in 18 ms. Remains 486 /502 variables (removed 16) and now considering 400/416 (removed 16) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-05-22 00:08:16] [INFO ] Computed 100 invariants in 5 ms
[2024-05-22 00:08:16] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:08:16] [INFO ] Invariant cache hit.
[2024-05-22 00:08:16] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 741 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/502 places, 400/416 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 767 ms. Remains : 483/502 places, 400/416 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), true, (NOT p1), (AND p3 (NOT p2)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-06 finished in 1044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&F(p2)))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1071 edges and 497 vertex of which 496 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 347
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 347
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 434 transition count 245
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 312 transition count 245
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 360 place count 300 transition count 233
Iterating global reduction 2 with 12 rules applied. Total rules applied 372 place count 300 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 231
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 231
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 627 place count 170 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 629 place count 169 transition count 112
Applied a total of 629 rules in 71 ms. Remains 169 /502 variables (removed 333) and now considering 112/416 (removed 304) transitions.
// Phase 1: matrix 112 rows 169 cols
[2024-05-22 00:08:17] [INFO ] Computed 75 invariants in 3 ms
[2024-05-22 00:08:17] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 147 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/502 places, 112/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 147/502 places, 112/416 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-07 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1071 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 348
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 348
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 122 place count 435 transition count 246
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 346 place count 313 transition count 246
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 233
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 231
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 231
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 627 place count 170 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 629 place count 169 transition count 112
Applied a total of 629 rules in 38 ms. Remains 169 /502 variables (removed 333) and now considering 112/416 (removed 304) transitions.
// Phase 1: matrix 112 rows 169 cols
[2024-05-22 00:08:17] [INFO ] Computed 75 invariants in 1 ms
[2024-05-22 00:08:17] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 132 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/502 places, 112/416 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 147/502 places, 112/416 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 19881 reset in 218 ms.
Product exploration explored 100000 steps with 19808 reset in 262 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/147 stabilizing places and 25/112 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 137 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 40 ms :[(NOT p0)]
RANDOM walk for 121 steps (29 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
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 109 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 147 cols
[2024-05-22 00:08:18] [INFO ] Computed 53 invariants in 1 ms
[2024-05-22 00:08:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 00:08:18] [INFO ] Invariant cache hit.
[2024-05-22 00:08:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:08:18] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [3, 4, 5, 6, 24, 26, 32, 34, 36, 38, 40, 42, 44, 51, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 125, 127, 129, 131, 133, 137]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 318 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/147 places, 112/112 transitions.
Graph (complete) has 297 edges and 108 vertex of which 99 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 99 transition count 95
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 86 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 83 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 83 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 83 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 81 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 78 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 78 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 57 place count 70 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 68 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 68 transition count 77
Applied a total of 62 rules in 10 ms. Remains 68 /108 variables (removed 40) and now considering 77/112 (removed 35) transitions.
// Phase 1: matrix 77 rows 68 cols
[2024-05-22 00:08:18] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 00:08:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 00:08:18] [INFO ] Invariant cache hit.
[2024-05-22 00:08:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:08:18] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/147 places, 77/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 478 ms. Remains : 67/147 places, 77/112 transitions.
Computed a total of 11 stabilizing places and 12 stable transitions
Computed a total of 11 stabilizing places and 12 stable transitions
Detected a total of 11/67 stabilizing places and 12/77 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 114 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)]
RANDOM walk for 133 steps (35 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
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 81 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 20 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20415 reset in 86 ms.
Product exploration explored 100000 steps with 20309 reset in 95 ms.
Built C files in :
/tmp/ltsmin1467913002213798997
[2024-05-22 00:08:19] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-05-22 00:08:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:19] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-05-22 00:08:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:19] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-05-22 00:08:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1467913002213798997
Running compilation step : cd /tmp/ltsmin1467913002213798997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin1467913002213798997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1467913002213798997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7932725199754656778.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 2511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 400
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 398
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 398
Applied a total of 36 rules in 63 ms. Remains 484 /502 variables (removed 18) and now considering 398/416 (removed 18) transitions.
// Phase 1: matrix 398 rows 484 cols
[2024-05-22 00:08:19] [INFO ] Computed 100 invariants in 5 ms
[2024-05-22 00:08:20] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 00:08:20] [INFO ] Invariant cache hit.
[2024-05-22 00:08:20] [INFO ] Implicit Places using invariants and state equation in 560 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 776 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 398/416 transitions.
Applied a total of 0 rules in 10 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 849 ms. Remains : 481/502 places, 398/416 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 669 reset in 272 ms.
Product exploration explored 100000 steps with 673 reset in 300 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1037 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/398 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 21550 steps (141 resets) in 125 ms. (171 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 416 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 398/398 transitions.
Applied a total of 0 rules in 32 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
// Phase 1: matrix 398 rows 481 cols
[2024-05-22 00:08:22] [INFO ] Computed 97 invariants in 3 ms
[2024-05-22 00:08:23] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-22 00:08:23] [INFO ] Invariant cache hit.
[2024-05-22 00:08:23] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2024-05-22 00:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:32] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:08:33] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:08:36] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:08:37] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 5 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:38] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:39] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:41] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 3 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:42] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 3 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 7 ms to minimize.
[2024-05-22 00:08:43] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:08:44] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:08:45] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:47] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:49] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:50] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:08:51] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:52] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 19/166 constraints. Problems are: Problem set: 0 solved, 397 unsolved
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 1.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 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 (/ 3.0 2.0))
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 2.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 2.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.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 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.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 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.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 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/879 variables, and 166 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 69/166 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:57] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:08:58] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:59] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:00] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:09:01] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:02] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:03] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:04] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:13] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:13] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:09:15] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:09:15] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:09:15] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 4 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
SMT process timed out in 60206ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in LTL mode , in 1 iterations and 61285 ms. Remains : 481/481 places, 398/398 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1037 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/398 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 37139 steps (249 resets) in 113 ms. (325 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 679 reset in 168 ms.
Product exploration explored 100000 steps with 671 reset in 193 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 398/398 transitions.
Graph (trivial) has 220 edges and 481 vertex of which 6 / 481 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 1031 edges and 476 vertex of which 475 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
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 475 transition count 391
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 73 Pre rules applied. Total rules applied 51 place count 475 transition count 442
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 124 place count 475 transition count 442
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 140 place count 459 transition count 411
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 156 place count 459 transition count 411
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 265 places in 0 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 315 place count 459 transition count 411
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 353 place count 421 transition count 373
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 391 place count 421 transition count 373
Deduced a syphon composed of 227 places in 0 ms
Applied a total of 391 rules in 97 ms. Remains 421 /481 variables (removed 60) and now considering 373/398 (removed 25) transitions.
[2024-05-22 00:09:25] [INFO ] Redundant transitions in 22 ms returned []
Running 372 sub problems to find dead transitions.
// Phase 1: matrix 373 rows 421 cols
[2024-05-22 00:09:25] [INFO ] Computed 97 invariants in 5 ms
[2024-05-22 00:09:25] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 59/96 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 20/117 constraints. Problems are: Problem set: 96 solved, 276 unsolved
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 20/137 constraints. Problems are: Problem set: 194 solved, 178 unsolved
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 20/157 constraints. Problems are: Problem set: 233 solved, 139 unsolved
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
Problem TDEAD98 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 15/172 constraints. Problems are: Problem set: 240 solved, 132 unsolved
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 9/181 constraints. Problems are: Problem set: 241 solved, 131 unsolved
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 8/189 constraints. Problems are: Problem set: 243 solved, 129 unsolved
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 5/194 constraints. Problems are: Problem set: 243 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/194 constraints. Problems are: Problem set: 243 solved, 129 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 12 (OVERLAPS) 372/793 variables, 421/615 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/793 variables, 10/625 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/793 variables, 0/625 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 1/794 variables, 1/626 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/626 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/626 constraints. Problems are: Problem set: 274 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 626 constraints, problems are : Problem set: 274 solved, 98 unsolved in 28363 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 421/421 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 274 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 181/374 variables, 59/59 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 3/62 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 97/159 constraints. Problems are: Problem set: 274 solved, 98 unsolved
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 18/177 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/177 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 45/419 variables, 35/212 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/212 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 372/791 variables, 419/631 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 10/641 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 98/739 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 0/739 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 2/793 variables, 2/741 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/793 variables, 0/741 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 1/794 variables, 1/742 constraints. Problems are: Problem set: 274 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/794 variables, 0/742 constraints. Problems are: Problem set: 274 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 742 constraints, problems are : Problem set: 274 solved, 98 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 421/421 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 98/372 constraints, Known Traps: 115/115 constraints]
After SMT, in 58726ms problems are : Problem set: 274 solved, 98 unsolved
Search for dead transitions found 274 dead transitions in 58732ms
Found 274 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 274 transitions
Dead transitions reduction (with SMT) removed 274 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 421/481 places, 99/398 transitions.
Graph (complete) has 740 edges and 421 vertex of which 194 are kept as prefixes of interest. Removing 227 places using SCC suffix rule.1 ms
Discarding 227 places :
Also discarding 0 output transitions
Ensure Unique test removed 31 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 163 transition count 111
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 18 ms. Remains 163 /421 variables (removed 258) and now considering 111/99 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 163/481 places, 111/398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58878 ms. Remains : 163/481 places, 111/398 transitions.
Built C files in :
/tmp/ltsmin15155527445666015341
[2024-05-22 00:10:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15155527445666015341
Running compilation step : cd /tmp/ltsmin15155527445666015341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 913 ms.
Running link step : cd /tmp/ltsmin15155527445666015341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin15155527445666015341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17117951763985929896.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 398/398 transitions.
Applied a total of 0 rules in 22 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
// Phase 1: matrix 398 rows 481 cols
[2024-05-22 00:10:39] [INFO ] Computed 97 invariants in 5 ms
[2024-05-22 00:10:40] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 00:10:40] [INFO ] Invariant cache hit.
[2024-05-22 00:10:40] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2024-05-22 00:10:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:10:47] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 5 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:10:48] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:54] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 19/166 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 13/179 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/879 variables, and 179 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 82/179 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 29 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/879 variables, and 303 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 0/397 constraints, Known Traps: 206/206 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 481/481 places, 398/398 transitions.
Built C files in :
/tmp/ltsmin10135672198560264602
[2024-05-22 00:11:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10135672198560264602
Running compilation step : cd /tmp/ltsmin10135672198560264602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin10135672198560264602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10135672198560264602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased137955321666975395.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:11:55] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:11:55] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:11:55] [INFO ] Time to serialize gal into /tmp/LTL16986656447278763408.gal : 7 ms
[2024-05-22 00:11:55] [INFO ] Time to serialize properties into /tmp/LTL16304186776948782131.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16986656447278763408.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6280085384631311795.hoa' '-atoms' '/tmp/LTL16304186776948782131.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16304186776948782131.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6280085384631311795.hoa
Detected timeout of ITS tools.
[2024-05-22 00:12:10] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:12:10] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:12:10] [INFO ] Time to serialize gal into /tmp/LTL7554698513895872780.gal : 3 ms
[2024-05-22 00:12:10] [INFO ] Time to serialize properties into /tmp/LTL13420821906799798333.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7554698513895872780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13420821906799798333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p239!=1)")&&(G("(p213!=1)")))))))
Formula 0 simplified : XXG(!"(p239!=1)" | F!"(p213!=1)")
Detected timeout of ITS tools.
[2024-05-22 00:12:26] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:12:26] [INFO ] Applying decomposition
[2024-05-22 00:12:26] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16048453806877806918.txt' '-o' '/tmp/graph16048453806877806918.bin' '-w' '/tmp/graph16048453806877806918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16048453806877806918.bin' '-l' '-1' '-v' '-w' '/tmp/graph16048453806877806918.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:26] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:26] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-22 00:12:26] [INFO ] Flatten gal took : 84 ms
[2024-05-22 00:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 18 ms.
[2024-05-22 00:12:26] [INFO ] Time to serialize gal into /tmp/LTL17502289560428595532.gal : 12 ms
[2024-05-22 00:12:26] [INFO ] Time to serialize properties into /tmp/LTL8278852845947299032.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17502289560428595532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8278852845947299032.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i0.i0.u79.p239!=1)")&&(G("(i12.u71.p213!=1)")))))))
Formula 0 simplified : XXG(!"(i0.i0.u79.p239!=1)" | F!"(i12.u71.p213!=1)")
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 261699 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||X(p1)) U X(X(p2))))'
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 401
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 399
Applied a total of 34 rules in 58 ms. Remains 485 /502 variables (removed 17) and now considering 399/416 (removed 17) transitions.
// Phase 1: matrix 399 rows 485 cols
[2024-05-22 00:12:41] [INFO ] Computed 100 invariants in 6 ms
[2024-05-22 00:12:41] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-22 00:12:41] [INFO ] Invariant cache hit.
[2024-05-22 00:12:42] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 993 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/502 places, 399/416 transitions.
Applied a total of 0 rules in 11 ms. Remains 482 /482 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1062 ms. Remains : 482/502 places, 399/416 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 1322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(p1&&F(G(p2)))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 401
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 399
Applied a total of 34 rules in 39 ms. Remains 485 /502 variables (removed 17) and now considering 399/416 (removed 17) transitions.
// Phase 1: matrix 399 rows 485 cols
[2024-05-22 00:12:42] [INFO ] Computed 100 invariants in 6 ms
[2024-05-22 00:12:43] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-22 00:12:43] [INFO ] Invariant cache hit.
[2024-05-22 00:12:43] [INFO ] Implicit Places using invariants and state equation in 532 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 791 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/502 places, 399/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 482 /482 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 840 ms. Remains : 482/502 places, 399/416 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 804 reset in 199 ms.
Product exploration explored 100000 steps with 806 reset in 193 ms.
Computed a total of 205 stabilizing places and 177 stable transitions
Graph (complete) has 1038 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 205 stabilizing places and 177 stable transitions
Detected a total of 205/482 stabilizing places and 177/399 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 261 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (265 resets) in 447 ms. (89 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (48 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
// Phase 1: matrix 399 rows 482 cols
[2024-05-22 00:12:45] [INFO ] Computed 97 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 212/357 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 108/465 variables, 34/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/476 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 395/871 variables, 476/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/880 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/880 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/881 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/881 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/881 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 579 constraints, problems are : Problem set: 0 solved, 4 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 212/357 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:12:46] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 5 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 4 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:47] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:48] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 108/465 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:12:49] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/476 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 395/871 variables, 476/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/871 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:50] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/871 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/871 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 9/880 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:12:51] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:12:51] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 5968ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 399/399 transitions.
Graph (trivial) has 221 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 1 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 1031 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 476 transition count 340
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 425 transition count 340
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 425 transition count 239
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 304 transition count 239
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 589 place count 170 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 591 place count 169 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 593 place count 169 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 595 place count 167 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 596 place count 167 transition count 112
Applied a total of 596 rules in 43 ms. Remains 167 /482 variables (removed 315) and now considering 112/399 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 167/482 places, 112/399 transitions.
RANDOM walk for 40000 steps (1100 resets) in 564 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (458 resets) in 340 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (497 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
// Phase 1: matrix 112 rows 167 cols
[2024-05-22 00:12:51] [INFO ] Computed 72 invariants in 4 ms
[2024-05-22 00:12:51] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/158 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/165 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 112/277 variables, 165/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/279 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 75/131 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/158 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/165 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 112/277 variables, 165/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/279 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 279/279 variables, and 262 constraints, problems are : Problem set: 2 solved, 0 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 670ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p0)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 16 factoid took 429 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 482 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 399/399 transitions.
Graph (trivial) has 221 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1032 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 475 transition count 340
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 424 transition count 340
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 424 transition count 239
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 303 transition count 239
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 587 place count 170 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 589 place count 169 transition count 115
Applied a total of 589 rules in 27 ms. Remains 169 /482 variables (removed 313) and now considering 115/399 (removed 284) transitions.
// Phase 1: matrix 115 rows 169 cols
[2024-05-22 00:12:52] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:12:53] [INFO ] Implicit Places using invariants in 137 ms returned [1, 2, 3, 4, 5, 8, 9, 28, 29, 30, 31, 36, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 140 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/482 places, 115/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 147/482 places, 115/399 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/147 stabilizing places and 25/115 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 10840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1||X(X((p2 U p3))))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 489 transition count 403
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 489 transition count 403
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 487 transition count 401
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 487 transition count 401
Applied a total of 30 rules in 33 ms. Remains 487 /502 variables (removed 15) and now considering 401/416 (removed 15) transitions.
// Phase 1: matrix 401 rows 487 cols
[2024-05-22 00:12:53] [INFO ] Computed 100 invariants in 5 ms
[2024-05-22 00:12:53] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-22 00:12:53] [INFO ] Invariant cache hit.
[2024-05-22 00:12:54] [INFO ] Implicit Places using invariants and state equation in 485 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 702 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/502 places, 401/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 484 /484 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 744 ms. Remains : 484/502 places, 401/416 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1071 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 347
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 347
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 246
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 346 place count 313 transition count 246
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 233
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 231
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 231
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 629 place count 169 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 631 place count 168 transition count 111
Applied a total of 631 rules in 33 ms. Remains 168 /502 variables (removed 334) and now considering 111/416 (removed 305) transitions.
// Phase 1: matrix 111 rows 168 cols
[2024-05-22 00:12:54] [INFO ] Computed 75 invariants in 1 ms
[2024-05-22 00:12:54] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 167 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/502 places, 111/416 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 146/502 places, 111/416 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(X((!p0 U (p1||G(!p0)))))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 402
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 402
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 400
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 400
Applied a total of 32 rules in 34 ms. Remains 486 /502 variables (removed 16) and now considering 400/416 (removed 16) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-05-22 00:12:55] [INFO ] Computed 100 invariants in 3 ms
[2024-05-22 00:12:55] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 00:12:55] [INFO ] Invariant cache hit.
[2024-05-22 00:12:55] [INFO ] Implicit Places using invariants and state equation in 506 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 740 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/502 places, 400/416 transitions.
Applied a total of 0 rules in 10 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 784 ms. Remains : 483/502 places, 400/416 transitions.
Stuttering acceptance computed with spot in 411 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 150 ms.
Product exploration explored 100000 steps with 20000 reset in 181 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1041 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (270 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (49 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (47 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 496175 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 3
Probabilistic random walk after 496175 steps, saw 83035 distinct states, run finished after 3008 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 400 rows 483 cols
[2024-05-22 00:13:00] [INFO ] Computed 97 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 5 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 5097ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 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 1034 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 342
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 342
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 427 transition count 238
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 303 transition count 238
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 597 place count 167 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 599 place count 166 transition count 111
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 601 place count 166 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 603 place count 164 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 604 place count 164 transition count 109
Applied a total of 604 rules in 24 ms. Remains 164 /483 variables (removed 319) and now considering 109/400 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 164/483 places, 109/400 transitions.
RANDOM walk for 40000 steps (1217 resets) in 170 ms. (233 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (744 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
// Phase 1: matrix 109 rows 164 cols
[2024-05-22 00:13:05] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:13:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 109/271 variables, 162/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 12/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/273 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/162 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 109/271 variables, 162/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 12/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/273 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/273 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/273 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 400/400 transitions.
Applied a total of 0 rules in 15 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 483 cols
[2024-05-22 00:13:06] [INFO ] Computed 97 invariants in 6 ms
[2024-05-22 00:13:06] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 00:13:06] [INFO ] Invariant cache hit.
[2024-05-22 00:13:06] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-22 00:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 30218ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Finished structural reductions in LTL mode , in 1 iterations and 30869 ms. Remains : 483/483 places, 400/400 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1041 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (273 resets) in 392 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (47 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 645193 steps, run timeout after 3003 ms. (steps per millisecond=214 ) properties seen :0 out of 3
Probabilistic random walk after 645193 steps, saw 105290 distinct states, run finished after 3003 ms. (steps per millisecond=214 ) properties seen :0
[2024-05-22 00:13:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 4 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 112/466 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/477 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 396/873 variables, 477/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 10/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/882 variables, 5/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 5057ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 1 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 1034 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 342
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 342
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 427 transition count 238
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 303 transition count 238
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 597 place count 167 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 599 place count 166 transition count 111
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 601 place count 166 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 603 place count 164 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 604 place count 164 transition count 109
Applied a total of 604 rules in 44 ms. Remains 164 /483 variables (removed 319) and now considering 109/400 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 164/483 places, 109/400 transitions.
RANDOM walk for 40000 steps (1155 resets) in 195 ms. (204 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (735 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
// Phase 1: matrix 109 rows 164 cols
[2024-05-22 00:13:46] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:13:46] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 109/271 variables, 162/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 12/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/273 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/162 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 109/271 variables, 162/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 12/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/273 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/273 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/273 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 169 ms.
Product exploration explored 100000 steps with 20000 reset in 155 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 298 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1035 edges and 478 vertex of which 477 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
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 393
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 52 place count 477 transition count 448
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 126 place count 477 transition count 448
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 460 transition count 415
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 460 transition count 415
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 267 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 320 place count 460 transition count 415
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 358 place count 422 transition count 377
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 396 place count 422 transition count 377
Deduced a syphon composed of 229 places in 1 ms
Applied a total of 396 rules in 82 ms. Remains 422 /483 variables (removed 61) and now considering 377/400 (removed 23) transitions.
[2024-05-22 00:13:48] [INFO ] Redundant transitions in 19 ms returned []
Running 376 sub problems to find dead transitions.
// Phase 1: matrix 377 rows 422 cols
[2024-05-22 00:13:48] [INFO ] Computed 97 invariants in 8 ms
[2024-05-22 00:13:48] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/422 variables, 59/96 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 2 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:13:58] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/117 constraints. Problems are: Problem set: 93 solved, 283 unsolved
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:59] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 28 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/137 constraints. Problems are: Problem set: 204 solved, 172 unsolved
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD329 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/157 constraints. Problems are: Problem set: 240 solved, 136 unsolved
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/177 constraints. Problems are: Problem set: 246 solved, 130 unsolved
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/183 constraints. Problems are: Problem set: 246 solved, 130 unsolved
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-22 00:14:10] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 13/196 constraints. Problems are: Problem set: 248 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/196 constraints. Problems are: Problem set: 248 solved, 128 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 11 (OVERLAPS) 376/798 variables, 422/618 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 9/627 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 0/627 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 1/799 variables, 1/628 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/799 variables, 0/628 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/799 variables, 0/628 constraints. Problems are: Problem set: 279 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 628 constraints, problems are : Problem set: 279 solved, 97 unsolved in 29172 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 422/422 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 279 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 181/373 variables, 59/59 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 1/60 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 99/159 constraints. Problems are: Problem set: 279 solved, 97 unsolved
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 22 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/179 constraints. Problems are: Problem set: 279 solved, 97 unsolved
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 7/186 constraints. Problems are: Problem set: 279 solved, 97 unsolved
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 3/189 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/189 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 47/420 variables, 37/226 constraints. Problems are: Problem set: 279 solved, 97 unsolved
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 15/241 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/241 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 376/796 variables, 420/661 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 9/670 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/796 variables, 97/767 constraints. Problems are: Problem set: 279 solved, 97 unsolved
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/796 variables, 2/769 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/796 variables, 0/769 constraints. Problems are: Problem set: 279 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 2/798 variables, 2/771 constraints. Problems are: Problem set: 279 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/799 variables, and 771 constraints, problems are : Problem set: 279 solved, 97 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 422/422 constraints, ReadFeed: 9/10 constraints, PredecessorRefiner: 97/376 constraints, Known Traps: 146/146 constraints]
After SMT, in 59523ms problems are : Problem set: 279 solved, 97 unsolved
Search for dead transitions found 279 dead transitions in 59529ms
Found 279 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 279 transitions
Dead transitions reduction (with SMT) removed 279 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 422/483 places, 98/400 transitions.
Graph (complete) has 741 edges and 422 vertex of which 193 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.1 ms
Discarding 229 places :
Also discarding 0 output transitions
Ensure Unique test removed 33 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 160 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 18 ms. Remains 160 /422 variables (removed 262) and now considering 110/98 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 160/483 places, 110/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59672 ms. Remains : 160/483 places, 110/400 transitions.
Built C files in :
/tmp/ltsmin1232628193018615875
[2024-05-22 00:14:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1232628193018615875
Running compilation step : cd /tmp/ltsmin1232628193018615875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 860 ms.
Running link step : cd /tmp/ltsmin1232628193018615875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1232628193018615875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6902085507988956812.hoa' '--buchi-type=spotba'
LTSmin run took 267 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-15 finished in 114083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-15-LTLFireability-10
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 502/502 places, 416/416 transitions.
Graph (trivial) has 238 edges and 502 vertex of which 6 / 502 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 1071 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 348
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 348
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 122 place count 435 transition count 248
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 340 place count 317 transition count 248
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 354 place count 303 transition count 234
Iterating global reduction 2 with 14 rules applied. Total rules applied 368 place count 303 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 368 place count 303 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 301 transition count 232
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 623 place count 173 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 625 place count 172 transition count 113
Applied a total of 625 rules in 60 ms. Remains 172 /502 variables (removed 330) and now considering 113/416 (removed 303) transitions.
// Phase 1: matrix 113 rows 172 cols
[2024-05-22 00:14:49] [INFO ] Computed 77 invariants in 3 ms
[2024-05-22 00:14:49] [INFO ] Implicit Places using invariants in 226 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 40, 41, 45, 46, 50, 51, 52, 53, 56, 57, 143, 147]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 240 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 148/502 places, 113/416 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 303 ms. Remains : 148/502 places, 113/416 transitions.
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 21656 reset in 212 ms.
Product exploration explored 100000 steps with 21441 reset in 222 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/148 stabilizing places and 26/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 231 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 7220 steps (1735 resets) in 27 ms. (257 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 148 /148 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 148 cols
[2024-05-22 00:14:51] [INFO ] Computed 53 invariants in 1 ms
[2024-05-22 00:14:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:14:51] [INFO ] Invariant cache hit.
[2024-05-22 00:14:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:14:51] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [3, 4, 5, 6, 24, 26, 37, 39, 41, 43, 45, 47, 49, 56, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 126, 128, 130, 132, 134, 138]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 342 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/148 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 103 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 103 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 105
Applied a total of 14 rules in 8 ms. Remains 102 /109 variables (removed 7) and now considering 105/113 (removed 8) transitions.
// Phase 1: matrix 105 rows 102 cols
[2024-05-22 00:14:51] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 00:14:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 00:14:51] [INFO ] Invariant cache hit.
[2024-05-22 00:14:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:14:51] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/148 places, 105/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 102/148 places, 105/113 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 21 stable transitions
Detected a total of 19/102 stabilizing places and 21/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 9824 steps (2365 resets) in 22 ms. (427 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 492 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 21700 reset in 118 ms.
Product exploration explored 100000 steps with 21512 reset in 127 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 105/105 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 93 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 93 transition count 104
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 20 rules in 7 ms. Remains 93 /102 variables (removed 9) and now considering 104/105 (removed 1) transitions.
[2024-05-22 00:14:53] [INFO ] Redundant transitions in 5 ms returned []
Running 99 sub problems to find dead transitions.
// Phase 1: matrix 104 rows 93 cols
[2024-05-22 00:14:53] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 00:14:53] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 97 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/105 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 4/109 constraints. Problems are: Problem set: 33 solved, 66 unsolved
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 4/113 constraints. Problems are: Problem set: 33 solved, 66 unsolved
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/115 constraints. Problems are: Problem set: 33 solved, 66 unsolved
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/116 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/116 constraints. Problems are: Problem set: 33 solved, 66 unsolved
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/196 variables, 2/118 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/118 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/118 constraints. Problems are: Problem set: 33 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/197 variables, and 118 constraints, problems are : Problem set: 33 solved, 66 unsolved in 3517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 33 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 9/10 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 3/76 variables, 7/17 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/20 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/20 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 2/78 variables, 1/21 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 103/181 variables, 78/99 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 4/103 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 66/169 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/169 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 15/196 variables, 15/184 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/184 constraints. Problems are: Problem set: 33 solved, 66 unsolved
At refinement iteration 15 (OVERLAPS) 0/196 variables, 0/184 constraints. Problems are: Problem set: 33 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/197 variables, and 184 constraints, problems are : Problem set: 33 solved, 66 unsolved in 2525 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 66/99 constraints, Known Traps: 11/11 constraints]
After SMT, in 6124ms problems are : Problem set: 33 solved, 66 unsolved
Search for dead transitions found 33 dead transitions in 6127ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 71/105 transitions.
Graph (complete) has 233 edges and 93 vertex of which 74 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 70 /93 variables (removed 23) and now considering 71/71 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/102 places, 71/105 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6153 ms. Remains : 70/102 places, 71/105 transitions.
Built C files in :
/tmp/ltsmin1979960522986087620
[2024-05-22 00:14:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1979960522986087620
Running compilation step : cd /tmp/ltsmin1979960522986087620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin1979960522986087620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1979960522986087620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15713236025310523480.hoa' '--buchi-type=spotba'
LTSmin run took 621 ms.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 11777 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-22 00:15:00] [INFO ] Flatten gal took : 22 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 460030 ms.

BK_STOP 1716336901001

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;