Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716306233033

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:43:55] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-21 15:43:55] [INFO ] Transformed 593 places.
[2024-05-21 15:43:55] [INFO ] Transformed 536 transitions.
[2024-05-21 15:43:55] [INFO ] Found NUPN structural information;
[2024-05-21 15:43:55] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 84 place count 501 transition count 449
Iterating global reduction 1 with 79 rules applied. Total rules applied 163 place count 501 transition count 449
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 205 place count 459 transition count 407
Iterating global reduction 1 with 42 rules applied. Total rules applied 247 place count 459 transition count 407
Applied a total of 247 rules in 203 ms. Remains 459 /585 variables (removed 126) and now considering 407/528 (removed 121) transitions.
// Phase 1: matrix 407 rows 459 cols
[2024-05-21 15:43:56] [INFO ] Computed 90 invariants in 55 ms
[2024-05-21 15:43:56] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-21 15:43:56] [INFO ] Invariant cache hit.
[2024-05-21 15:43:57] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2024-05-21 15:43:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-21 15:44:05] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 24 ms to minimize.
[2024-05-21 15:44:05] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:44:05] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 3 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:44:06] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:44:07] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:44:08] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 7 ms to minimize.
[2024-05-21 15:44:09] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/130 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 15:44:10] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 8 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:44:11] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 4 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:44:12] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 6 ms to minimize.
[2024-05-21 15:44:13] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:44:13] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:44:13] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:44:13] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/150 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 15:44:16] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:44:16] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:44:17] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:44:18] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:44:18] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:44:18] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:44:18] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:44:18] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:44:19] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/170 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 15:44:20] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:44:21] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:44:21] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:44:21] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:44:21] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 7 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 3 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:44:22] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:44:23] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-05-21 15:44:23] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:44:23] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 7 ms to minimize.
[2024-05-21 15:44:23] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:44:23] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-21 15:44:24] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-05-21 15:44:24] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 2 ms to minimize.
[2024-05-21 15:44:24] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:44:24] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/190 constraints. Problems are: Problem set: 22 solved, 384 unsolved
[2024-05-21 15:44:25] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
[2024-05-21 15:44:25] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:44:25] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:44:25] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:44:26] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 1 ms to minimize.
[2024-05-21 15:44:27] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:44:27] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:44:27] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:44:27] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:44:27] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
SMT process timed out in 30214ms, After SMT, problems are : Problem set: 22 solved, 384 unsolved
Search for dead transitions found 22 dead transitions in 30231ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 459/585 places, 385/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 459 /459 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31864 ms. Remains : 459/585 places, 385/528 transitions.
Support contains 32 out of 459 places after structural reductions.
[2024-05-21 15:44:27] [INFO ] Flatten gal took : 65 ms
[2024-05-21 15:44:27] [INFO ] Flatten gal took : 38 ms
[2024-05-21 15:44:28] [INFO ] Input system was already deterministic with 385 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (283 resets) in 1743 ms. (22 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40003 steps (50 resets) in 209 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (50 resets) in 498 ms. (80 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (51 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (37 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (51 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (50 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
// Phase 1: matrix 385 rows 459 cols
[2024-05-21 15:44:29] [INFO ] Computed 90 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 167/189 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:44:29] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 147/336 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:44:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:44:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-05-21 15:44:29] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 111/447 variables, 37/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:44:30] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
Problem AtomicPropp5 is UNSAT
[2024-05-21 15:44:31] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/117 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-21 15:44:32] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 6/123 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 1/124 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/124 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/449 variables, 1/125 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 378/827 variables, 449/574 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/827 variables, 7/581 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 827/844 variables, and 581 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 449/459 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 159/172 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 160/332 variables, 41/53 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 11/64 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:44:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:44:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 19/83 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:44:36] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:44:37] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 17/100 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 115/447 variables, 37/137 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 30/167 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 4/171 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:44:38] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:44:39] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:44:39] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:44:39] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 5 ms to minimize.
[2024-05-21 15:44:39] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 3 ms to minimize.
SMT process timed out in 10056ms, After SMT, problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (complete) has 996 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 50 place count 458 transition count 335
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 409 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 407 transition count 333
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 103 place count 407 transition count 241
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 303 place count 299 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 308 place count 294 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 313 place count 294 transition count 236
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 547 place count 175 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 548 place count 175 transition count 120
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 4 with 2 rules applied. Total rules applied 550 place count 174 transition count 124
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 559 place count 174 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 560 place count 173 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 561 place count 172 transition count 123
Applied a total of 561 rules in 198 ms. Remains 172 /459 variables (removed 287) and now considering 123/385 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 172/459 places, 123/385 transitions.
RANDOM walk for 40000 steps (4343 resets) in 970 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1218 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1210 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1081 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1220 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1235 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1236 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1237 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1082 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 235897 steps, run visited all 8 properties in 622 ms. (steps per millisecond=379 )
Probabilistic random walk after 235897 steps, saw 54719 distinct states, run finished after 627 ms. (steps per millisecond=376 ) properties seen :8
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 996 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 990 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 452 transition count 325
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 400 transition count 325
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 400 transition count 228
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 286 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 219
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 219
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 567 place count 159 transition count 105
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 569 place count 158 transition count 109
Applied a total of 569 rules in 82 ms. Remains 158 /459 variables (removed 301) and now considering 109/385 (removed 276) transitions.
// Phase 1: matrix 109 rows 158 cols
[2024-05-21 15:44:41] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 15:44:41] [INFO ] Implicit Places using invariants in 132 ms returned [3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 135 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/459 places, 109/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 140/459 places, 109/385 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 448 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 448 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 446 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 446 transition count 372
Applied a total of 26 rules in 55 ms. Remains 446 /459 variables (removed 13) and now considering 372/385 (removed 13) transitions.
// Phase 1: matrix 372 rows 446 cols
[2024-05-21 15:44:42] [INFO ] Computed 90 invariants in 13 ms
[2024-05-21 15:44:42] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 15:44:42] [INFO ] Invariant cache hit.
[2024-05-21 15:44:42] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [142, 143, 144]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 747 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/459 places, 372/385 transitions.
Applied a total of 0 rules in 7 ms. Remains 443 /443 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 811 ms. Remains : 443/459 places, 372/385 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 1041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 6 / 459 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 990 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 452 transition count 325
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 400 transition count 325
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 400 transition count 228
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 286 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 219
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 219
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 566 place count 160 transition count 105
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 568 place count 159 transition count 109
Applied a total of 568 rules in 58 ms. Remains 159 /459 variables (removed 300) and now considering 109/385 (removed 276) transitions.
// Phase 1: matrix 109 rows 159 cols
[2024-05-21 15:44:43] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 15:44:43] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 135 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/459 places, 109/385 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 139/459 places, 109/385 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 215 edges and 459 vertex of which 6 / 459 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 990 edges and 454 vertex of which 453 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 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 452 transition count 326
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 326
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 401 transition count 228
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 317 place count 286 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 219
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 219
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 565 place count 160 transition count 106
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 567 place count 159 transition count 110
Applied a total of 567 rules in 39 ms. Remains 159 /459 variables (removed 300) and now considering 110/385 (removed 275) transitions.
// Phase 1: matrix 110 rows 159 cols
[2024-05-21 15:44:43] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 15:44:43] [INFO ] Implicit Places using invariants in 118 ms returned [1, 2, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 121 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/459 places, 110/385 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 141/459 places, 110/385 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 283 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((G((!p0&&X(G((!p0||G(p1))))))||(!p0&&X(G((!p0||G(p1))))&&F((!p2||G(p0))))))))'
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (complete) has 996 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 50 place count 457 transition count 334
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 408 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 406 transition count 332
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 103 place count 406 transition count 232
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 320 place count 289 transition count 232
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 329 place count 280 transition count 223
Iterating global reduction 3 with 9 rules applied. Total rules applied 338 place count 280 transition count 223
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 568 place count 163 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 163 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 571 place count 162 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 161 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 573 place count 160 transition count 112
Applied a total of 573 rules in 62 ms. Remains 160 /459 variables (removed 299) and now considering 112/385 (removed 273) transitions.
// Phase 1: matrix 112 rows 160 cols
[2024-05-21 15:44:43] [INFO ] Computed 68 invariants in 3 ms
[2024-05-21 15:44:43] [INFO ] Implicit Places using invariants in 129 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/459 places, 112/385 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 159/459 places, 112/385 transitions.
Stuttering acceptance computed with spot in 273 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07
Product exploration explored 100000 steps with 12113 reset in 440 ms.
Product exploration explored 100000 steps with 12031 reset in 386 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 170 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4872 resets) in 363 ms. (109 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (1235 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1518 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1488 resets) in 418 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1225 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1233 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1502 resets) in 143 ms. (277 steps per ms) remains 4/7 properties
// Phase 1: matrix 112 rows 159 cols
[2024-05-21 15:44:46] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 15:44:46] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/81 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29/110 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/114 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 112/226 variables, 114/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 45/271 variables, 45/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 21/231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/271 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 231 constraints, problems are : Problem set: 1 solved, 3 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 159/159 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 34/79 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/108 variables, 17/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/112 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 112/224 variables, 112/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 5/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 47/271 variables, 47/209 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 22/231 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 3/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/271 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 234 constraints, problems are : Problem set: 1 solved, 3 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 159/159 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 175 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Parikh walk visited 3 properties in 28 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 18 factoid took 526 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 301 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 15:44:47] [INFO ] Invariant cache hit.
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 15:44:48] [INFO ] Invariant cache hit.
[2024-05-21 15:44:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [26, 27, 28, 52, 53, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 79, 81, 83, 85, 87, 89, 91, 93, 101, 103, 105, 107, 109, 143, 145, 147, 149, 151]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 406 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/159 places, 112/112 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 126 transition count 104
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 118 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 115 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 115 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 115 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 114 transition count 98
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 42 place count 104 transition count 90
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 4 with 2 rules applied. Total rules applied 44 place count 103 transition count 89
Applied a total of 44 rules in 14 ms. Remains 103 /126 variables (removed 23) and now considering 89/112 (removed 23) transitions.
// Phase 1: matrix 89 rows 103 cols
[2024-05-21 15:44:48] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 15:44:48] [INFO ] Invariant cache hit.
[2024-05-21 15:44:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [2, 3, 4, 6, 7, 8, 10, 14, 15, 18, 19, 20, 21, 22, 23, 24, 43, 44]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 242 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/159 places, 89/112 transitions.
Graph (complete) has 287 edges and 85 vertex of which 76 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 4 ms. Remains 76 /85 variables (removed 9) and now considering 85/89 (removed 4) transitions.
// Phase 1: matrix 85 rows 76 cols
[2024-05-21 15:44:48] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 15:44:48] [INFO ] Invariant cache hit.
[2024-05-21 15:44:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:44:48] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 76/159 places, 85/112 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 832 ms. Remains : 76/159 places, 85/112 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4939 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1239 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1538 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1495 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1288 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1240 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1479 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 2508 steps, run visited all 6 properties in 23 ms. (steps per millisecond=109 )
Probabilistic random walk after 2508 steps, saw 896 distinct states, run finished after 23 ms. (steps per millisecond=109 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 465 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter insensitive) to 5 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 299 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 311 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 12138 reset in 233 ms.
Product exploration explored 100000 steps with 12210 reset in 236 ms.
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 85/85 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 74 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 72 transition count 82
Applied a total of 5 rules in 5 ms. Remains 72 /76 variables (removed 4) and now considering 82/85 (removed 3) transitions.
// Phase 1: matrix 82 rows 72 cols
[2024-05-21 15:44:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 15:44:51] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 15:44:51] [INFO ] Invariant cache hit.
[2024-05-21 15:44:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:44:51] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-21 15:44:51] [INFO ] Redundant transitions in 18 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-21 15:44:51] [INFO ] Invariant cache hit.
[2024-05-21 15:44:51] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/71 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD26 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 TDEAD34 is UNSAT
At refinement iteration 5 (OVERLAPS) 82/153 variables, 71/81 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 5/86 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/86 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/87 constraints. Problems are: Problem set: 14 solved, 65 unsolved
[2024-05-21 15:44:52] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/88 constraints. Problems are: Problem set: 14 solved, 65 unsolved
[2024-05-21 15:44:53] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:44:53] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/90 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/90 constraints. Problems are: Problem set: 14 solved, 65 unsolved
[2024-05-21 15:44:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/154 variables, 1/91 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 0/91 constraints. Problems are: Problem set: 14 solved, 65 unsolved
[2024-05-21 15:44:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/154 variables, 1/92 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 0/92 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 16 (OVERLAPS) 0/154 variables, 0/92 constraints. Problems are: Problem set: 14 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 92 constraints, problems are : Problem set: 14 solved, 65 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 14 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/71 variables, 3/10 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 82/153 variables, 71/81 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 5/86 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/86 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/87 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 65/152 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 5/157 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/157 constraints. Problems are: Problem set: 14 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 0/154 variables, 0/157 constraints. Problems are: Problem set: 14 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 157 constraints, problems are : Problem set: 14 solved, 65 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 65/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 5278ms problems are : Problem set: 14 solved, 65 unsolved
Search for dead transitions found 14 dead transitions in 5279ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/76 places, 68/85 transitions.
Ensure Unique test removed 4 places
Applied a total of 0 rules in 2 ms. Remains 68 /72 variables (removed 4) and now considering 68/68 (removed 0) transitions.
[2024-05-21 15:44:57] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 5535 ms. Remains : 68/76 places, 68/85 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 13449 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)||(p1 U (p2||G(p1))))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 375
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 373
Applied a total of 24 rules in 41 ms. Remains 447 /459 variables (removed 12) and now considering 373/385 (removed 12) transitions.
// Phase 1: matrix 373 rows 447 cols
[2024-05-21 15:44:57] [INFO ] Computed 90 invariants in 2 ms
[2024-05-21 15:44:57] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 15:44:57] [INFO ] Invariant cache hit.
[2024-05-21 15:44:57] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [142, 143, 144]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 513 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/459 places, 373/385 transitions.
Applied a total of 0 rules in 13 ms. Remains 444 /444 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 444/459 places, 373/385 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 714 reset in 191 ms.
Product exploration explored 100000 steps with 714 reset in 194 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 963 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 135 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (284 resets) in 312 ms. (127 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (50 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (47 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (51 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (48 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
// Phase 1: matrix 373 rows 444 cols
[2024-05-21 15:44:58] [INFO ] Computed 87 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:44:59] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:44:59] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:44:59] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:44:59] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 104/425 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/434 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 366/800 variables, 434/525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf8 is UNSAT
At refinement iteration 12 (OVERLAPS) 11/811 variables, 6/531 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:44:59] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/811 variables, 1/532 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/811 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/817 variables, 4/536 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/817 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/817 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 536 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 4/56 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:45:00] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 15/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 104/425 variables, 32/103 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:01] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/434 variables, 3/107 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 366/800 variables, 434/541 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 4/545 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:02] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:45:02] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:45:02] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:45:02] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 4/549 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:02] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/800 variables, 1/550 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/800 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 11/811 variables, 6/556 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/811 variables, 1/557 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/811 variables, 5/562 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:45:03] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:45:04] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:45:05] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:45:05] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 4 ms to minimize.
SMT process timed out in 6341ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 373/373 transitions.
Graph (trivial) has 200 edges and 444 vertex of which 6 / 444 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 956 edges and 439 vertex of which 438 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 438 transition count 320
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 393 transition count 320
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 393 transition count 227
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 284 transition count 227
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 162 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 161 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 161 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 159 transition count 111
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 545 place count 159 transition count 111
Applied a total of 545 rules in 38 ms. Remains 159 /444 variables (removed 285) and now considering 111/373 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 159/444 places, 111/373 transitions.
RANDOM walk for 40000 steps (1690 resets) in 206 ms. (193 steps per ms) remains 1/4 properties
BEST_FIRST walk for 614 steps (4 resets) in 6 ms. (87 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 p2))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 543 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 373/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 444 /444 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2024-05-21 15:45:06] [INFO ] Invariant cache hit.
[2024-05-21 15:45:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 15:45:06] [INFO ] Invariant cache hit.
[2024-05-21 15:45:07] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 15:45:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:13] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:45:14] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:45:14] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:45:14] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:45:14] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:14] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:45:15] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:45:15] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:45:15] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:45:15] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:45:16] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:45:17] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:17] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:45:17] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:45:19] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:45:20] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:45:20] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:45:20] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:45:20] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:45:21] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:45:22] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:45:23] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:45:24] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:45:25] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:25] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:25] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:45:29] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:45:30] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 4 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Finished structural reductions in LTL mode , in 1 iterations and 30861 ms. Remains : 444/444 places, 373/373 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 963 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (AND p0 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 116 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (284 resets) in 243 ms. (163 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (45 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (50 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
[2024-05-21 15:45:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 104/425 variables, 32/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/434 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 366/800 variables, 434/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 11/811 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/811 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/817 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/817 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/817 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 537 constraints, problems are : Problem set: 0 solved, 4 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 104/425 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/434 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 366/800 variables, 434/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 4/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/811 variables, 6/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/817 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/817 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/817 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 547 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 2254ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 211 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=35 )
Parikh walk visited 4 properties in 291 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (AND p0 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 343 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 716 reset in 261 ms.
Product exploration explored 100000 steps with 718 reset in 247 ms.
Support contains 4 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 373/373 transitions.
Applied a total of 0 rules in 7 ms. Remains 444 /444 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2024-05-21 15:45:42] [INFO ] Invariant cache hit.
[2024-05-21 15:45:42] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-21 15:45:42] [INFO ] Invariant cache hit.
[2024-05-21 15:45:42] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 15:45:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:53] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:45:57] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:45:58] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:46:04] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 88 places in 193 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 4 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/817 variables, and 183 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/444 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 96/183 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:46:17] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:46:24] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:46:25] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:46:26] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:46:29] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 5 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:46:30] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 4 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:46:31] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:32] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:46:33] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:46:34] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:46:35] [INFO ] Deduced a trap composed of 80 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:46:35] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 4 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:46:36] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:46:37] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:46:37] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:46:37] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 3 ms to minimize.
[2024-05-21 15:46:37] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 15:46:38] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:46:39] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:46:40] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:46:41] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:46:41] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/817 variables, and 268 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 0/372 constraints, Known Traps: 181/181 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 444/444 places, 373/373 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 105829 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 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 375
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 373
Applied a total of 24 rules in 24 ms. Remains 447 /459 variables (removed 12) and now considering 373/385 (removed 12) transitions.
// Phase 1: matrix 373 rows 447 cols
[2024-05-21 15:46:43] [INFO ] Computed 90 invariants in 3 ms
[2024-05-21 15:46:43] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 15:46:43] [INFO ] Invariant cache hit.
[2024-05-21 15:46:43] [INFO ] Implicit Places using invariants and state equation in 406 ms returned [142, 143, 144]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 595 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/459 places, 373/385 transitions.
Applied a total of 0 rules in 7 ms. Remains 444 /444 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 626 ms. Remains : 444/459 places, 373/385 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 716 reset in 247 ms.
Product exploration explored 100000 steps with 713 reset in 244 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 963 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 119 stabilizing places and 112 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 109 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 57 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (286 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (49 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22653 steps, run visited all 1 properties in 100 ms. (steps per millisecond=226 )
Probabilistic random walk after 22653 steps, saw 9754 distinct states, run finished after 100 ms. (steps per millisecond=226 ) 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 148 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-13-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 990 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 452 transition count 327
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 402 transition count 327
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 102 place count 402 transition count 229
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 315 place count 287 transition count 229
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 325 place count 277 transition count 219
Iterating global reduction 2 with 10 rules applied. Total rules applied 335 place count 277 transition count 219
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 563 place count 161 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 565 place count 160 transition count 111
Applied a total of 565 rules in 37 ms. Remains 160 /459 variables (removed 299) and now considering 111/385 (removed 274) transitions.
// Phase 1: matrix 111 rows 160 cols
[2024-05-21 15:46:44] [INFO ] Computed 69 invariants in 3 ms
[2024-05-21 15:46:44] [INFO ] Implicit Places using invariants in 158 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 47, 48, 49, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 160 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/459 places, 111/385 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 142/459 places, 111/385 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-11 finished in 275 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 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 375
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 373
Applied a total of 24 rules in 26 ms. Remains 447 /459 variables (removed 12) and now considering 373/385 (removed 12) transitions.
// Phase 1: matrix 373 rows 447 cols
[2024-05-21 15:46:45] [INFO ] Computed 90 invariants in 3 ms
[2024-05-21 15:46:45] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 15:46:45] [INFO ] Invariant cache hit.
[2024-05-21 15:46:45] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [142, 143, 144]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 712 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/459 places, 373/385 transitions.
Applied a total of 0 rules in 7 ms. Remains 444 /444 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 444/459 places, 373/385 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 990 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 452 transition count 326
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 326
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 104 place count 401 transition count 229
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 315 place count 287 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 323 place count 279 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 331 place count 279 transition count 221
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 559 place count 163 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 561 place count 162 transition count 113
Applied a total of 561 rules in 30 ms. Remains 162 /459 variables (removed 297) and now considering 113/385 (removed 272) transitions.
// Phase 1: matrix 113 rows 162 cols
[2024-05-21 15:46:45] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 15:46:46] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 161 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/459 places, 113/385 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 143/459 places, 113/385 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p0&&X(G((!p0||G(p1))))))||(!p0&&X(G((!p0||G(p1))))&&F((!p2||G(p0))))))))'
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)||(p1 U (p2||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-08
Stuttering acceptance computed with spot in 242 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Graph (trivial) has 212 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 990 edges and 454 vertex of which 453 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 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 452 transition count 326
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 326
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 104 place count 401 transition count 231
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 310 place count 290 transition count 231
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 319 place count 281 transition count 222
Iterating global reduction 2 with 9 rules applied. Total rules applied 328 place count 281 transition count 222
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 556 place count 165 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 164 transition count 114
Applied a total of 558 rules in 38 ms. Remains 164 /459 variables (removed 295) and now considering 114/385 (removed 271) transitions.
// Phase 1: matrix 114 rows 164 cols
[2024-05-21 15:46:46] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 15:46:46] [INFO ] Implicit Places using invariants in 172 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 23, 24, 25, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 187 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/459 places, 114/385 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 232 ms. Remains : 146/459 places, 114/385 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 21874 reset in 381 ms.
Product exploration explored 100000 steps with 21651 reset in 264 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 171 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (9859 resets) in 728 ms. (54 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (2875 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3082 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3013 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3061 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3029 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
// Phase 1: matrix 114 rows 146 cols
[2024-05-21 15:46:48] [INFO ] Computed 52 invariants in 6 ms
[2024-05-21 15:46:48] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/117 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/143 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 113/256 variables, 143/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf8 is UNSAT
At refinement iteration 10 (OVERLAPS) 3/259 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 203 constraints, problems are : Problem set: 1 solved, 4 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/117 variables, 30/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 26/143 variables, 18/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/256 variables, 143/195 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/200 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 4/204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/259 variables, 3/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 207 constraints, problems are : Problem set: 1 solved, 4 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 56 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 114/114 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 146 transition count 113
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 1 with 2 rules applied. Total rules applied 3 place count 145 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 145 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 143 transition count 110
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 143 transition count 110
Applied a total of 12 rules in 15 ms. Remains 143 /146 variables (removed 3) and now considering 110/114 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 143/146 places, 110/114 transitions.
RANDOM walk for 610 steps (29 resets) in 7 ms. (76 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 p2))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 537 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-21 15:46:50] [INFO ] Invariant cache hit.
[2024-05-21 15:46:50] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 15:46:50] [INFO ] Invariant cache hit.
[2024-05-21 15:46:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:46:50] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [1, 3, 7, 10, 13, 14, 15, 16, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 94, 95, 130, 132, 134, 136, 138]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 401 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/146 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 transition count 108
Applied a total of 8 rules in 3 ms. Remains 103 /107 variables (removed 4) and now considering 108/114 (removed 6) transitions.
// Phase 1: matrix 108 rows 103 cols
[2024-05-21 15:46:50] [INFO ] Computed 15 invariants in 3 ms
[2024-05-21 15:46:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 15:46:50] [INFO ] Invariant cache hit.
[2024-05-21 15:46:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:46:50] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/146 places, 108/114 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 103/146 places, 108/114 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 292 edges and 103 vertex of which 89 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (AND p0 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 205 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (10020 resets) in 128 ms. (310 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (2846 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3049 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3030 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3043 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
[2024-05-21 15:46:51] [INFO ] Invariant cache hit.
[2024-05-21 15:46:51] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 97/117 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/128 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 77/205 variables, 70/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/206 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/208 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/210 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/210 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/117 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/128 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 77/205 variables, 70/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/206 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/206 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/208 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/210 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:46:51] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/210 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 126 constraints, problems are : Problem set: 0 solved, 4 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 44 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (AND p0 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 507 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 287 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21602 reset in 163 ms.
Product exploration explored 100000 steps with 21592 reset in 143 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 15:46:53] [INFO ] Invariant cache hit.
[2024-05-21 15:46:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 15:46:53] [INFO ] Invariant cache hit.
[2024-05-21 15:46:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:46:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 15:46:53] [INFO ] Invariant cache hit.
[2024-05-21 15:46:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/210 variables, 103/118 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/121 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/121 constraints. Problems are: Problem set: 14 solved, 89 unsolved
[2024-05-21 15:46:55] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/210 variables, 1/122 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/122 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/122 constraints. Problems are: Problem set: 14 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 122 constraints, problems are : Problem set: 14 solved, 89 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 14 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 10/10 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/11 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/16 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 107/210 variables, 103/119 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 3/122 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 89/211 constraints. Problems are: Problem set: 14 solved, 89 unsolved
[2024-05-21 15:46:57] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:46:57] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:46:57] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 3/214 constraints. Problems are: Problem set: 14 solved, 89 unsolved
[2024-05-21 15:46:58] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:46:59] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 2/216 constraints. Problems are: Problem set: 14 solved, 89 unsolved
[2024-05-21 15:47:00] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 1/217 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/217 constraints. Problems are: Problem set: 14 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/217 constraints. Problems are: Problem set: 14 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 217 constraints, problems are : Problem set: 14 solved, 89 unsolved in 6197 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/103 constraints, Known Traps: 7/7 constraints]
After SMT, in 9004ms problems are : Problem set: 14 solved, 89 unsolved
Search for dead transitions found 14 dead transitions in 9007ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/103 places, 94/108 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 94
Applied a total of 4 rules in 2 ms. Remains 99 /103 variables (removed 4) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 99 cols
[2024-05-21 15:47:02] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 15:47:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 15:47:02] [INFO ] Invariant cache hit.
[2024-05-21 15:47:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:47:03] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [43, 45, 47]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 212 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/103 places, 94/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 9443 ms. Remains : 96/103 places, 94/108 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 16749 ms.
[2024-05-21 15:47:03] [INFO ] Flatten gal took : 44 ms
[2024-05-21 15:47:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:47:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 459 places, 385 transitions and 1187 arcs took 9 ms.
Total runtime 187871 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-13

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 459
TRANSITIONS: 385
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


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


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

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

Process ID: 3178
MODEL NAME: /home/mcc/execution/418/model
459 places, 385 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-13-LTLFireability-07 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-LTLFireability-08 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716307200268

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

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

MEDDLY ERROR: Insufficient memory

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-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-13, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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