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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716336956948

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:15:58] [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:15:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:15:58] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-22 00:15:58] [INFO ] Transformed 650 places.
[2024-05-22 00:15:58] [INFO ] Transformed 580 transitions.
[2024-05-22 00:15:58] [INFO ] Found NUPN structural information;
[2024-05-22 00:15:58] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 203 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 3 formulas.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 555 transition count 488
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 555 transition count 488
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 223 place count 511 transition count 444
Iterating global reduction 1 with 44 rules applied. Total rules applied 267 place count 511 transition count 444
Applied a total of 267 rules in 128 ms. Remains 511 /646 variables (removed 135) and now considering 444/576 (removed 132) transitions.
// Phase 1: matrix 444 rows 511 cols
[2024-05-22 00:15:58] [INFO ] Computed 105 invariants in 34 ms
[2024-05-22 00:15:59] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-22 00:15:59] [INFO ] Invariant cache hit.
[2024-05-22 00:16:00] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 00:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/511 variables, 62/101 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 29 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 6 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 6 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 4 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 5 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 6 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 20/185 constraints. Problems are: Problem set: 2 solved, 441 unsolved
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 5 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 20/205 constraints. Problems are: Problem set: 23 solved, 420 unsolved
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
SMT process timed out in 30291ms, After SMT, problems are : Problem set: 23 solved, 420 unsolved
Search for dead transitions found 23 dead transitions in 30318ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 511/646 places, 421/576 transitions.
Applied a total of 0 rules in 30 ms. Remains 511 /511 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31829 ms. Remains : 511/646 places, 421/576 transitions.
Support contains 29 out of 511 places after structural reductions.
[2024-05-22 00:16:30] [INFO ] Flatten gal took : 74 ms
[2024-05-22 00:16:30] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:16:30] [INFO ] Input system was already deterministic with 421 transitions.
RANDOM walk for 40000 steps (262 resets) in 1565 ms. (25 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (45 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (46 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (46 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
// Phase 1: matrix 421 rows 511 cols
[2024-05-22 00:16:31] [INFO ] Computed 106 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 73/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 254/341 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 159/500 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:16:33] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:16:34] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:16:35] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:36] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
SMT process timed out in 5054ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 421/421 transitions.
Graph (trivial) has 229 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1094 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 504 transition count 360
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 452 transition count 360
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 106 place count 452 transition count 256
Deduced a syphon composed of 104 places in 1 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 334 place count 328 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 339 place count 323 transition count 251
Iterating global reduction 2 with 5 rules applied. Total rules applied 344 place count 323 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 323 transition count 250
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 346 place count 322 transition count 250
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 607 place count 189 transition count 122
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 610 place count 189 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 613 place count 186 transition count 119
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 618 place count 186 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 185 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 184 transition count 118
Applied a total of 620 rules in 200 ms. Remains 184 /511 variables (removed 327) and now considering 118/421 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 184/511 places, 118/421 transitions.
RANDOM walk for 40000 steps (780 resets) in 1499 ms. (26 steps per ms) remains 1/9 properties
BEST_FIRST walk for 8141 steps (35 resets) in 61 ms. (131 steps per ms) remains 0/1 properties
Computed a total of 213 stabilizing places and 185 stable transitions
Graph (complete) has 1102 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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(G(p0))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 34 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
// Phase 1: matrix 411 rows 501 cols
[2024-05-22 00:16:37] [INFO ] Computed 106 invariants in 17 ms
[2024-05-22 00:16:38] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 00:16:38] [INFO ] Invariant cache hit.
[2024-05-22 00:16:38] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 827 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 27 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
[2024-05-22 00:16:39] [INFO ] Invariant cache hit.
[2024-05-22 00:16:39] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:16:39] [INFO ] Invariant cache hit.
[2024-05-22 00:16:39] [INFO ] Implicit Places using invariants and state equation in 494 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 679 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 716 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (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-17-LTLFireability-01
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 989 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)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 41 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
[2024-05-22 00:16:40] [INFO ] Invariant cache hit.
[2024-05-22 00:16:40] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-22 00:16:40] [INFO ] Invariant cache hit.
[2024-05-22 00:16:40] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 751 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 799 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 661 reset in 252 ms.
Product exploration explored 100000 steps with 660 reset in 256 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1084 edges and 500 vertex of which 499 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (263 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (46 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 83655 steps, run visited all 1 properties in 391 ms. (steps per millisecond=213 )
Probabilistic random walk after 83655 steps, saw 18135 distinct states, run finished after 395 ms. (steps per millisecond=211 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 2147 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 32 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
[2024-05-22 00:16:42] [INFO ] Invariant cache hit.
[2024-05-22 00:16:42] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 00:16:42] [INFO ] Invariant cache hit.
[2024-05-22 00:16:42] [INFO ] Implicit Places using invariants and state equation in 508 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 721 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1084 edges and 500 vertex of which 499 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/500 stabilizing places and 178/411 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 43 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 1302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 413
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 413
Applied a total of 16 rules in 29 ms. Remains 503 /511 variables (removed 8) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 503 cols
[2024-05-22 00:16:43] [INFO ] Computed 106 invariants in 12 ms
[2024-05-22 00:16:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:16:43] [INFO ] Invariant cache hit.
[2024-05-22 00:16:44] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 866 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 502/511 places, 413/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 502/511 places, 413/421 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-07 finished in 1022 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))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 23 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
// Phase 1: matrix 411 rows 501 cols
[2024-05-22 00:16:44] [INFO ] Computed 106 invariants in 14 ms
[2024-05-22 00:16:44] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 00:16:44] [INFO ] Invariant cache hit.
[2024-05-22 00:16:45] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 745 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 164 ms.
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1084 edges and 500 vertex of which 499 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 1268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 22 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
[2024-05-22 00:16:45] [INFO ] Invariant cache hit.
[2024-05-22 00:16:45] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:16:45] [INFO ] Invariant cache hit.
[2024-05-22 00:16:46] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 749 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 780 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1084 edges and 500 vertex of which 499 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 31 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 1386 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((X(p0) U (p1||G(p2)))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 505 transition count 415
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 505 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 504 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 504 transition count 414
Applied a total of 14 rules in 37 ms. Remains 504 /511 variables (removed 7) and now considering 414/421 (removed 7) transitions.
// Phase 1: matrix 414 rows 504 cols
[2024-05-22 00:16:47] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:16:47] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 00:16:47] [INFO ] Invariant cache hit.
[2024-05-22 00:16:47] [INFO ] Implicit Places using invariants and state equation in 579 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 801 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 414/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 847 ms. Remains : 503/511 places, 414/421 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 766 reset in 340 ms.
Product exploration explored 100000 steps with 771 reset in 276 ms.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1088 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/503 stabilizing places and 181/414 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 336 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (260 resets) in 188 ms. (211 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (45 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
// Phase 1: matrix 414 rows 503 cols
[2024-05-22 00:16:49] [INFO ] Computed 105 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/332 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
[2024-05-22 00:16:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 139/471 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/497 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:16:50] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:16:51] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 410/907 variables, 497/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:16:52] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:16:53] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:54] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:16:54] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:16:54] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:16:54] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:16:54] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
SMT process timed out in 5089ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 414/414 transitions.
Graph (trivial) has 227 edges and 503 vertex of which 6 / 503 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 1081 edges and 498 vertex of which 497 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 497 transition count 355
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 446 transition count 355
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 446 transition count 249
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 320 transition count 249
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 614 place count 178 transition count 113
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 616 place count 177 transition count 117
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 177 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 620 place count 175 transition count 115
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 621 place count 175 transition count 115
Applied a total of 621 rules in 45 ms. Remains 175 /503 variables (removed 328) and now considering 115/414 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 175/503 places, 115/414 transitions.
RANDOM walk for 40000 steps (1013 resets) in 323 ms. (123 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (324 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (503 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
// Phase 1: matrix 115 rows 175 cols
[2024-05-22 00:16:54] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 00:16:54] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/133 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/169 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/173 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 115/288 variables, 173/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 13/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/290 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/290 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 175/175 constraints, ReadFeed: 13/13 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/133 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/169 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/173 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 115/288 variables, 173/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 13/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/290 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/290 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 175/175 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 115/115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 175 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 174 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 173 transition count 113
Applied a total of 4 rules in 10 ms. Remains 173 /175 variables (removed 2) and now considering 113/115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 173/175 places, 113/115 transitions.
RANDOM walk for 40000 steps (1113 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (561 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 63 ms. (steps per millisecond=295 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 93 ms. (steps per millisecond=200 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 868 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 414/414 transitions.
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 414/414 (removed 0) transitions.
// Phase 1: matrix 414 rows 503 cols
[2024-05-22 00:16:56] [INFO ] Computed 105 invariants in 10 ms
[2024-05-22 00:16:57] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-22 00:16:57] [INFO ] Invariant cache hit.
[2024-05-22 00:16:57] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 5 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 3 solved, 410 unsolved
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 6 solved, 407 unsolved
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 5 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 6 solved, 407 unsolved
[2024-05-22 00:17:18] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:18] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:19] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 6 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 4 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 6 solved, 407 unsolved
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 5 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
Problem TDEAD359 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 7 solved, 406 unsolved
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 7 solved, 406 unsolved
Search for dead transitions found 7 dead transitions in 30108ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/503 places, 407/414 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 407
Applied a total of 1 rules in 10 ms. Remains 502 /503 variables (removed 1) and now considering 407/407 (removed 0) transitions.
// Phase 1: matrix 407 rows 502 cols
[2024-05-22 00:17:27] [INFO ] Computed 107 invariants in 3 ms
[2024-05-22 00:17:28] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 00:17:28] [INFO ] Invariant cache hit.
[2024-05-22 00:17:28] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 765 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 501/503 places, 407/414 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31812 ms. Remains : 501/503 places, 407/414 transitions.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1064 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/501 stabilizing places and 181/407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 374 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (259 resets) in 161 ms. (246 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
// Phase 1: matrix 407 rows 501 cols
[2024-05-22 00:17:29] [INFO ] Computed 106 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 132/492 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/495 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 403/898 variables, 495/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/907 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/907 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/908 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/908 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 908/908 variables, and 614 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 132/492 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/495 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 403/898 variables, 495/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/898 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/898 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/898 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/907 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/907 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/908 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/908 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/908 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 908/908 variables, and 622 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1950ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 407/407 transitions.
Graph (trivial) has 228 edges and 501 vertex of which 6 / 501 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 1057 edges and 496 vertex of which 495 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 495 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 348
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 444 transition count 242
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 318 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 317 transition count 241
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 317 transition count 241
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 618 place count 173 transition count 105
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 620 place count 172 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 622 place count 172 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 624 place count 170 transition count 107
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 625 place count 170 transition count 107
Applied a total of 625 rules in 41 ms. Remains 170 /501 variables (removed 331) and now considering 107/407 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 170/501 places, 107/407 transitions.
RANDOM walk for 40000 steps (1091 resets) in 236 ms. (168 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3183 steps (27 resets) in 9 ms. (318 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 17 factoid took 864 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 658 reset in 250 ms.
Product exploration explored 100000 steps with 655 reset in 278 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 407/407 transitions.
Graph (trivial) has 227 edges and 501 vertex of which 6 / 501 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 1058 edges and 496 vertex of which 495 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
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 400
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 53 place count 495 transition count 454
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 127 place count 495 transition count 454
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 478 transition count 421
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 478 transition count 421
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 328 place count 478 transition count 421
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 366 place count 440 transition count 383
Deduced a syphon composed of 237 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 404 place count 440 transition count 383
Deduced a syphon composed of 237 places in 0 ms
Applied a total of 404 rules in 137 ms. Remains 440 /501 variables (removed 61) and now considering 383/407 (removed 24) transitions.
[2024-05-22 00:17:33] [INFO ] Redundant transitions in 23 ms returned []
Running 382 sub problems to find dead transitions.
// Phase 1: matrix 383 rows 440 cols
[2024-05-22 00:17:33] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:17:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 61/104 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
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 TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 3 places in 21 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 TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem 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 TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 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 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 TDEAD196 is UNSAT
Problem TDEAD197 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 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 TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/126 constraints. Problems are: Problem set: 156 solved, 226 unsolved
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 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 TDEAD217 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/146 constraints. Problems are: Problem set: 212 solved, 170 unsolved
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/166 constraints. Problems are: Problem set: 243 solved, 139 unsolved
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 7 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/186 constraints. Problems are: Problem set: 265 solved, 117 unsolved
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/206 constraints. Problems are: Problem set: 269 solved, 113 unsolved
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 8/214 constraints. Problems are: Problem set: 269 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/214 constraints. Problems are: Problem set: 269 solved, 113 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 11 (OVERLAPS) 382/822 variables, 440/654 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 7/661 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 0/661 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 1/823 variables, 1/662 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/823 variables, 1/663 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/823 variables, 0/663 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 17 (OVERLAPS) 0/823 variables, 0/663 constraints. Problems are: Problem set: 281 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 663 constraints, problems are : Problem set: 281 solved, 101 unsolved in 28470 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 440/440 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 281 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 185/387 variables, 61/61 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 109/170 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 19/189 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/189 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 51/438 variables, 45/234 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:18:07] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 2/236 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/236 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 382/820 variables, 438/674 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 7/681 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 101/782 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/782 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 2/822 variables, 2/784 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 0/784 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 1/823 variables, 1/785 constraints. Problems are: Problem set: 281 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 785 constraints, problems are : Problem set: 281 solved, 101 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 440/440 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 101/382 constraints, Known Traps: 130/130 constraints]
After SMT, in 58845ms problems are : Problem set: 281 solved, 101 unsolved
Search for dead transitions found 281 dead transitions in 58852ms
Found 281 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 281 transitions
Dead transitions reduction (with SMT) removed 281 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 440/501 places, 102/407 transitions.
Graph (complete) has 778 edges and 440 vertex of which 203 are kept as prefixes of interest. Removing 237 places using SCC suffix rule.2 ms
Discarding 237 places :
Also discarding 0 output transitions
Ensure Unique test removed 34 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 169 transition count 108
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 169 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 26 ms. Remains 169 /440 variables (removed 271) and now considering 114/102 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 169/501 places, 114/407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59055 ms. Remains : 169/501 places, 114/407 transitions.
Built C files in :
/tmp/ltsmin17326121502476000706
[2024-05-22 00:18:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17326121502476000706
Running compilation step : cd /tmp/ltsmin17326121502476000706;'/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 1065 ms.
Running link step : cd /tmp/ltsmin17326121502476000706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin17326121502476000706;'/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/stateBased2337784537417262741.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 407/407 transitions.
Applied a total of 0 rules in 12 ms. Remains 501 /501 variables (removed 0) and now considering 407/407 (removed 0) transitions.
// Phase 1: matrix 407 rows 501 cols
[2024-05-22 00:18:48] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:18:48] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 00:18:48] [INFO ] Invariant cache hit.
[2024-05-22 00:18:48] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2024-05-22 00:18:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/102 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30132ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 30136ms
Finished structural reductions in LTL mode , in 1 iterations and 30808 ms. Remains : 501/501 places, 407/407 transitions.
Built C files in :
/tmp/ltsmin14664444431546987037
[2024-05-22 00:19:18] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14664444431546987037
Running compilation step : cd /tmp/ltsmin14664444431546987037;'/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 705 ms.
Running link step : cd /tmp/ltsmin14664444431546987037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin14664444431546987037;'/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/stateBased660507115053736719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:19:34] [INFO ] Time to serialize gal into /tmp/LTL662618852587985266.gal : 7 ms
[2024-05-22 00:19:34] [INFO ] Time to serialize properties into /tmp/LTL2108360389212703473.prop : 1 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/LTL662618852587985266.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11029906004031791547.hoa' '-atoms' '/tmp/LTL2108360389212703473.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...317
Loading property file /tmp/LTL2108360389212703473.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11029906004031791547.hoa
Detected timeout of ITS tools.
[2024-05-22 00:19:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:19:49] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:19:49] [INFO ] Time to serialize gal into /tmp/LTL14349483497123078296.gal : 3 ms
[2024-05-22 00:19:49] [INFO ] Time to serialize properties into /tmp/LTL8430630990108092935.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/LTL14349483497123078296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8430630990108092935.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 : !((G((X("(p327!=1)"))U(("(p610!=1)")||(G("(p309!=1)"))))))
Formula 0 simplified : F(X!"(p327!=1)" R (!"(p610!=1)" & F!"(p309!=1)"))
Detected timeout of ITS tools.
[2024-05-22 00:20:04] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:20:04] [INFO ] Applying decomposition
[2024-05-22 00:20:04] [INFO ] Flatten gal took : 30 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/graph2923326147662010210.txt' '-o' '/tmp/graph2923326147662010210.bin' '-w' '/tmp/graph2923326147662010210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2923326147662010210.bin' '-l' '-1' '-v' '-w' '/tmp/graph2923326147662010210.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:04] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:04] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-22 00:20:04] [INFO ] Flatten gal took : 66 ms
[2024-05-22 00:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2024-05-22 00:20:04] [INFO ] Time to serialize gal into /tmp/LTL11493878904145326663.gal : 9 ms
[2024-05-22 00:20:04] [INFO ] Time to serialize properties into /tmp/LTL900592925601715363.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/LTL11493878904145326663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL900592925601715363.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...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(i7.i3.u108.p327!=1)"))U(("(i19.u163.p610!=1)")||(G("(i4.i2.u103.p309!=1)"))))))
Formula 0 simplified : F(X!"(i7.i3.u108.p327!=1)" R (!"(i19.u163.p610!=1)" & F!"(i4.i2.u103.p309!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t181, t189, t201, t287, t291, t300, t401, t402, t405, t406, t414, i0.i0.t185, i0.i0....1376
Computing Next relation with stutter on 1312 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1351 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.5559,394316,1,0,748188,828,6954,1.15724e+06,302,2439,2025620
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 212692 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 411
Applied a total of 20 rules in 41 ms. Remains 501 /511 variables (removed 10) and now considering 411/421 (removed 10) transitions.
// Phase 1: matrix 411 rows 501 cols
[2024-05-22 00:20:19] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:20:20] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 00:20:20] [INFO ] Invariant cache hit.
[2024-05-22 00:20:20] [INFO ] Implicit Places using invariants and state equation in 588 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 905 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 411/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 500/511 places, 411/421 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 1791 reset in 217 ms.
Stack based approach found an accepted trace after 817 steps with 15 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 1305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Graph (trivial) has 237 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1095 edges and 505 vertex of which 504 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 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 503 transition count 357
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 448 transition count 357
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 112 place count 448 transition count 251
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 344 place count 322 transition count 251
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 351 place count 315 transition count 244
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 315 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 243
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 360 place count 314 transition count 243
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 625 place count 179 transition count 113
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 627 place count 178 transition count 117
Applied a total of 627 rules in 48 ms. Remains 178 /511 variables (removed 333) and now considering 117/421 (removed 304) transitions.
// Phase 1: matrix 117 rows 178 cols
[2024-05-22 00:20:21] [INFO ] Computed 81 invariants in 2 ms
[2024-05-22 00:20:21] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 162 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/511 places, 117/421 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 156/511 places, 117/421 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 17857 reset in 324 ms.
Product exploration explored 100000 steps with 17726 reset in 258 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (7930 resets) in 529 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2427 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 585 steps, run visited all 1 properties in 5 ms. (steps per millisecond=117 )
Probabilistic random walk after 585 steps, saw 275 distinct states, run finished after 6 ms. (steps per millisecond=97 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 117/117 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 156 cols
[2024-05-22 00:20:22] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:20:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 00:20:22] [INFO ] Invariant cache hit.
[2024-05-22 00:20:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:20:23] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [3, 6, 8, 26, 28, 30, 37, 39, 41, 43, 45, 52, 54, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 140, 142, 144]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 372 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/156 places, 117/117 transitions.
Graph (complete) has 333 edges and 119 vertex of which 110 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 110 transition count 100
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 97 transition count 100
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 93 transition count 94
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 93 transition count 94
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 37 place count 93 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 91 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 42 place count 88 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 45 place count 88 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 63 place count 77 transition count 82
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 67 place count 75 transition count 80
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 68 place count 75 transition count 79
Applied a total of 68 rules in 13 ms. Remains 75 /119 variables (removed 44) and now considering 79/117 (removed 38) transitions.
// Phase 1: matrix 79 rows 75 cols
[2024-05-22 00:20:23] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 00:20:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 00:20:23] [INFO ] Invariant cache hit.
[2024-05-22 00:20:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:20:23] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [5, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/156 places, 79/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 544 ms. Remains : 73/156 places, 79/117 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8189 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2503 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 316 steps, run visited all 1 properties in 5 ms. (steps per millisecond=63 )
Probabilistic random walk after 316 steps, saw 166 distinct states, run finished after 6 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 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 109 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18101 reset in 155 ms.
Product exploration explored 100000 steps with 18143 reset in 150 ms.
Built C files in :
/tmp/ltsmin17029318347319493793
[2024-05-22 00:20:24] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-05-22 00:20:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:24] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-05-22 00:20:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:24] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-05-22 00:20:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:20:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17029318347319493793
Running compilation step : cd /tmp/ltsmin17029318347319493793;'/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 286 ms.
Running link step : cd /tmp/ltsmin17029318347319493793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17029318347319493793;'/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/stateBased6372091289505481854.hoa' '--buchi-type=spotba'
LTSmin run took 307 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 3893 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 413
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 502 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 502 transition count 412
Applied a total of 18 rules in 28 ms. Remains 502 /511 variables (removed 9) and now considering 412/421 (removed 9) transitions.
// Phase 1: matrix 412 rows 502 cols
[2024-05-22 00:20:25] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:20:25] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 00:20:25] [INFO ] Invariant cache hit.
[2024-05-22 00:20:25] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 822 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 412/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 501/511 places, 412/421 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1085 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Detected a total of 207/501 stabilizing places and 179/412 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 1357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 414
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 413
Applied a total of 16 rules in 53 ms. Remains 503 /511 variables (removed 8) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 503 cols
[2024-05-22 00:20:26] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:20:26] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 00:20:26] [INFO ] Invariant cache hit.
[2024-05-22 00:20:27] [INFO ] Implicit Places using invariants and state equation in 616 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 866 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 502/511 places, 413/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 930 ms. Remains : 502/511 places, 413/421 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 1227 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((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Support contains 6 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 421/421 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 414
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 413
Applied a total of 16 rules in 45 ms. Remains 503 /511 variables (removed 8) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 503 cols
[2024-05-22 00:20:27] [INFO ] Computed 106 invariants in 12 ms
[2024-05-22 00:20:27] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 00:20:27] [INFO ] Invariant cache hit.
[2024-05-22 00:20:28] [INFO ] Implicit Places using invariants and state equation in 650 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 892 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 502/511 places, 413/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 947 ms. Remains : 502/511 places, 413/421 transitions.
Stuttering acceptance computed with spot in 968 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 658 reset in 255 ms.
Product exploration explored 100000 steps with 657 reset in 307 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1086 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/502 stabilizing places and 178/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 976 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (258 resets) in 984 ms. (40 steps per ms) remains 11/18 properties
BEST_FIRST walk for 40002 steps (47 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (49 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 417 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (48 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
// Phase 1: matrix 413 rows 502 cols
[2024-05-22 00:20:32] [INFO ] Computed 105 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf4 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:20:32] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:33] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:20:34] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/79 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 135/495 variables, 45/124 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/496 variables, 1/125 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 409/905 variables, 496/621 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/905 variables, 0/621 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 9/914 variables, 5/626 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/914 variables, 0/626 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/915 variables, 1/627 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/915 variables, 0/627 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/915 variables, 0/627 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/915 variables, and 627 constraints, problems are : Problem set: 2 solved, 9 unsolved in 3340 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/79 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 00:20:35] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:35] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:20:35] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:36] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:37] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/99 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 4 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:38] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:20:39] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/119 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:40] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/915 variables, and 121 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 0/46 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 62/62 constraints]
After SMT, in 8378ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 413/413 transitions.
Graph (trivial) has 225 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
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1079 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 496 transition count 356
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 447 transition count 356
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 447 transition count 249
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 320 transition count 249
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 608 place count 180 transition count 115
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 610 place count 179 transition count 119
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 613 place count 179 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 616 place count 176 transition count 116
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 621 place count 176 transition count 116
Applied a total of 621 rules in 25 ms. Remains 176 /502 variables (removed 326) and now considering 116/413 (removed 297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 176/502 places, 116/413 transitions.
RANDOM walk for 6143 steps (146 resets) in 101 ms. (60 steps per ms) remains 0/9 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p3 (NOT p2))), (G (OR p0 p1 p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p1 p3 p2))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT p0)), (F (NOT (OR p0 p3 p2)))]
Knowledge based reduction with 9 factoid took 756 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 721 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-22 00:20:42] [INFO ] Invariant cache hit.
[2024-05-22 00:20:42] [INFO ] [Real]Absence check using 59 positive place invariants in 25 ms returned sat
[2024-05-22 00:20:42] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 26 ms returned sat
[2024-05-22 00:20:43] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2024-05-22 00:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:20:43] [INFO ] [Nat]Absence check using 59 positive place invariants in 22 ms returned sat
[2024-05-22 00:20:44] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 23 ms returned sat
[2024-05-22 00:20:44] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-05-22 00:20:44] [INFO ] Computed and/alt/rep : 408/734/408 causal constraints (skipped 4 transitions) in 26 ms.
[2024-05-22 00:20:46] [INFO ] Added : 285 causal constraints over 57 iterations in 1942 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 413/413 transitions.
Applied a total of 0 rules in 20 ms. Remains 502 /502 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-22 00:20:46] [INFO ] Invariant cache hit.
[2024-05-22 00:20:46] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 00:20:46] [INFO ] Invariant cache hit.
[2024-05-22 00:20:47] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:20:55] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 6 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:56] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:20:57] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 3 solved, 409 unsolved
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 5 solved, 407 unsolved
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 5 solved, 407 unsolved
[2024-05-22 00:21:06] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:21:06] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:21:07] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
Problem TDEAD359 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/185 constraints. Problems are: Problem set: 7 solved, 405 unsolved
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/205 constraints. Problems are: Problem set: 8 solved, 404 unsolved
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/225 constraints. Problems are: Problem set: 8 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/915 variables, and 225 constraints, problems are : Problem set: 8 solved, 404 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 8 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 8 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 8 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 8 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 8 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 120/225 constraints. Problems are: Problem set: 8 solved, 404 unsolved
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 3 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 5 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/245 constraints. Problems are: Problem set: 8 solved, 404 unsolved
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/265 constraints. Problems are: Problem set: 8 solved, 404 unsolved
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/285 constraints. Problems are: Problem set: 9 solved, 403 unsolved
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/305 constraints. Problems are: Problem set: 9 solved, 403 unsolved
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/325 constraints. Problems are: Problem set: 9 solved, 403 unsolved
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 20/345 constraints. Problems are: Problem set: 9 solved, 403 unsolved
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 60131ms, After SMT, problems are : Problem set: 9 solved, 403 unsolved
Search for dead transitions found 9 dead transitions in 60138ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/502 places, 404/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 501 transition count 404
Applied a total of 1 rules in 9 ms. Remains 501 /502 variables (removed 1) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 501 cols
[2024-05-22 00:21:47] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 00:21:47] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 00:21:47] [INFO ] Invariant cache hit.
[2024-05-22 00:21:48] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 501/502 places, 404/413 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61729 ms. Remains : 501/502 places, 404/413 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1063 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 793 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (259 resets) in 318 ms. (125 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (46 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (46 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
[2024-05-22 00:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 120/126 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 234/360 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 135/495 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 400/895 variables, 495/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/895 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/895 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 9/904 variables, 5/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/904 variables, 9/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/904 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/905 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/905 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/905 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 905/905 variables, and 633 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3626 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 120/126 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 234/360 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 8754ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 404/404 transitions.
Graph (trivial) has 225 edges and 501 vertex of which 6 / 501 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 1056 edges and 496 vertex of which 495 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 495 transition count 347
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 446 transition count 347
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 446 transition count 240
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 319 transition count 240
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 613 place count 174 transition count 106
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 615 place count 173 transition count 110
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 619 place count 173 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 623 place count 169 transition count 106
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 628 place count 169 transition count 106
Applied a total of 628 rules in 37 ms. Remains 169 /501 variables (removed 332) and now considering 106/404 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 169/501 places, 106/404 transitions.
RANDOM walk for 3585 steps (79 resets) in 58 ms. (60 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F p1), (F (NOT (OR p0 p1 p3))), (F p2), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 663 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 890 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 890 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-22 00:22:01] [INFO ] Invariant cache hit.
[2024-05-22 00:22:01] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2024-05-22 00:22:01] [INFO ] [Real]Absence check using 59 positive and 50 generalized place invariants in 33 ms returned sat
[2024-05-22 00:22:02] [INFO ] [Real]Absence check using state equation in 1302 ms returned sat
[2024-05-22 00:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 20 ms returned sat
[2024-05-22 00:22:03] [INFO ] [Nat]Absence check using 59 positive and 50 generalized place invariants in 28 ms returned sat
[2024-05-22 00:22:04] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2024-05-22 00:22:04] [INFO ] Computed and/alt/rep : 401/706/401 causal constraints (skipped 2 transitions) in 26 ms.
[2024-05-22 00:22:06] [INFO ] Added : 284 causal constraints over 57 iterations in 2017 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 617 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 657 reset in 215 ms.
Product exploration explored 100000 steps with 657 reset in 251 ms.
Built C files in :
/tmp/ltsmin204651066248330293
[2024-05-22 00:22:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin204651066248330293
Running compilation step : cd /tmp/ltsmin204651066248330293;'/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 1015 ms.
Running link step : cd /tmp/ltsmin204651066248330293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin204651066248330293;'/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/stateBased6163415137349985790.hoa' '--buchi-type=spotba'
LTSmin run took 151 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 101076 ms.
All properties solved by simple procedures.
Total runtime 370467 ms.

BK_STOP 1716337328696

--------------------
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-17"
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-17, 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-171620399800580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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