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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 161K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716307822251

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:10:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:10:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:10:23] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-21 16:10:23] [INFO ] Transformed 650 places.
[2024-05-21 16:10:23] [INFO ] Transformed 580 transitions.
[2024-05-21 16:10:23] [INFO ] Found NUPN structural information;
[2024-05-21 16:10:23] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 555 transition count 488
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 555 transition count 488
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 223 place count 511 transition count 444
Iterating global reduction 1 with 44 rules applied. Total rules applied 267 place count 511 transition count 444
Applied a total of 267 rules in 277 ms. Remains 511 /646 variables (removed 135) and now considering 444/576 (removed 132) transitions.
// Phase 1: matrix 444 rows 511 cols
[2024-05-21 16:10:24] [INFO ] Computed 105 invariants in 33 ms
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-21 16:10:25] [INFO ] Invariant cache hit.
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-21 16:10:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/511 variables, 62/101 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-21 16:10:35] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 25 ms to minimize.
[2024-05-21 16:10:35] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:10:36] [INFO ] Deduced a trap composed of 104 places in 218 ms of which 3 ms to minimize.
[2024-05-21 16:10:36] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 3 ms to minimize.
[2024-05-21 16:10:36] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 3 ms to minimize.
[2024-05-21 16:10:36] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 2 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 15 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 3 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 2 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 95 places in 214 ms of which 5 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:10:38] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 4 ms to minimize.
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:10:39] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:10:40] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 4 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 8 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:10:41] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 6 ms to minimize.
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:10:42] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 14 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:10:43] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 6 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:10:44] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:10:45] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:10:48] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:10:49] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 20/185 constraints. Problems are: Problem set: 2 solved, 441 unsolved
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:10:50] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:10:51] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:10:52] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 20/205 constraints. Problems are: Problem set: 23 solved, 420 unsolved
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:10:53] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:10:54] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:10:55] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:10:55] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:10:55] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:10:55] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:10:55] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/955 variables, and 220 constraints, problems are : Problem set: 23 solved, 420 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/511 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 23 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 39/39 constraints. Problems are: Problem set: 23 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/39 constraints. Problems are: Problem set: 23 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/511 variables, 62/101 constraints. Problems are: Problem set: 23 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 4/105 constraints. Problems are: Problem set: 23 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 115/220 constraints. Problems are: Problem set: 23 solved, 420 unsolved
[2024-05-21 16:10:59] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:10:59] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:10:59] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 15 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:11:00] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:11:01] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 20/240 constraints. Problems are: Problem set: 23 solved, 420 unsolved
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:11:02] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 4 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:11:03] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:11:04] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 20/260 constraints. Problems are: Problem set: 23 solved, 420 unsolved
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:11:05] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:11:06] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:11:07] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:11:08] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:08] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 20/280 constraints. Problems are: Problem set: 28 solved, 415 unsolved
[2024-05-21 16:11:08] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:11:08] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:11:08] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:11:09] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:11:10] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:11:10] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:11:10] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:11:10] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:11:10] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:11:11] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:11:11] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:11:11] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:11:11] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:11:11] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 20/300 constraints. Problems are: Problem set: 28 solved, 415 unsolved
[2024-05-21 16:11:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:11:12] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:11:13] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:11:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:11:15] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:11:15] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:11:15] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:11:15] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:11:15] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 20/320 constraints. Problems are: Problem set: 28 solved, 415 unsolved
[2024-05-21 16:11:16] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:11:16] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:11:16] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:11:16] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:17] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:11:18] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:11:18] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:11:18] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:11:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:11:18] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:11:19] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:11:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:11:19] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 20/340 constraints. Problems are: Problem set: 32 solved, 411 unsolved
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:11:20] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 4 ms to minimize.
[2024-05-21 16:11:21] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:11:22] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:11:22] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:11:22] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:11:22] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:11:22] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 20/360 constraints. Problems are: Problem set: 32 solved, 411 unsolved
[2024-05-21 16:11:23] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 8 ms to minimize.
[2024-05-21 16:11:23] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-05-21 16:11:23] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:11:23] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:11:24] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:11:25] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 60258ms, After SMT, problems are : Problem set: 32 solved, 411 unsolved
Search for dead transitions found 32 dead transitions in 60280ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 511/646 places, 412/576 transitions.
Applied a total of 0 rules in 28 ms. Remains 511 /511 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61906 ms. Remains : 511/646 places, 412/576 transitions.
Support contains 29 out of 511 places after structural reductions.
[2024-05-21 16:11:26] [INFO ] Flatten gal took : 119 ms
[2024-05-21 16:11:26] [INFO ] Flatten gal took : 48 ms
[2024-05-21 16:11:26] [INFO ] Input system was already deterministic with 412 transitions.
RANDOM walk for 40000 steps (261 resets) in 1165 ms. (34 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40004 steps (44 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
// Phase 1: matrix 412 rows 511 cols
[2024-05-21 16:11:27] [INFO ] Computed 110 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 156/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 212/379 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:11:28] [INFO ] Deduced a trap composed of 15 places in 938 ms of which 2 ms to minimize.
[2024-05-21 16:11:29] [INFO ] Deduced a trap composed of 17 places in 1428 ms of which 1 ms to minimize.
[2024-05-21 16:11:30] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 5 ms to minimize.
[2024-05-21 16:11:30] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2024-05-21 16:11:30] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:11:30] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 4 ms to minimize.
[2024-05-21 16:11:30] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 82 places in 361 ms of which 2 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 1 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 126/505 variables, 49/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:11:31] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:11:32] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:11:32] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:11:32] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:11:32] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 2 ms to minimize.
SMT process timed out in 5093ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 412/412 transitions.
Graph (trivial) has 232 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1076 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 504 transition count 349
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 450 transition count 349
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 110 place count 450 transition count 245
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 338 place count 326 transition count 245
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 321 transition count 240
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 321 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 348 place count 321 transition count 239
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 350 place count 320 transition count 239
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 617 place count 182 transition count 110
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 620 place count 182 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 623 place count 179 transition count 107
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 628 place count 179 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 629 place count 178 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 630 place count 177 transition count 106
Applied a total of 630 rules in 217 ms. Remains 177 /511 variables (removed 334) and now considering 106/412 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 177/511 places, 106/412 transitions.
RANDOM walk for 40000 steps (789 resets) in 637 ms. (62 steps per ms) remains 1/6 properties
BEST_FIRST walk for 5034 steps (26 resets) in 12 ms. (387 steps per ms) remains 0/1 properties
Computed a total of 213 stabilizing places and 185 stable transitions
Graph (complete) has 1084 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 30 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
// Phase 1: matrix 402 rows 501 cols
[2024-05-21 16:11:33] [INFO ] Computed 110 invariants in 4 ms
[2024-05-21 16:11:33] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 16:11:33] [INFO ] Invariant cache hit.
[2024-05-21 16:11:34] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 730 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 770 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 1044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 25 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
[2024-05-21 16:11:34] [INFO ] Invariant cache hit.
[2024-05-21 16:11:34] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 16:11:34] [INFO ] Invariant cache hit.
[2024-05-21 16:11:35] [INFO ] Implicit Places using invariants and state equation in 464 ms returned [85, 86, 87]
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 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 32 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
[2024-05-21 16:11:35] [INFO ] Invariant cache hit.
[2024-05-21 16:11:35] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 16:11:35] [INFO ] Invariant cache hit.
[2024-05-21 16:11:36] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 647 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 689 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 657 reset in 262 ms.
Product exploration explored 100000 steps with 657 reset in 252 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 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 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (262 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 83655 steps, run visited all 1 properties in 300 ms. (steps per millisecond=278 )
Probabilistic random walk after 83655 steps, saw 18135 distinct states, run finished after 303 ms. (steps per millisecond=276 ) 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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 1953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 30 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
[2024-05-21 16:11:37] [INFO ] Invariant cache hit.
[2024-05-21 16:11:37] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 16:11:37] [INFO ] Invariant cache hit.
[2024-05-21 16:11:38] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 754 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 793 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/498 stabilizing places and 178/402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 1307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 404
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 404
Applied a total of 16 rules in 28 ms. Remains 503 /511 variables (removed 8) and now considering 404/412 (removed 8) transitions.
// Phase 1: matrix 404 rows 503 cols
[2024-05-21 16:11:38] [INFO ] Computed 110 invariants in 12 ms
[2024-05-21 16:11:39] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 16:11:39] [INFO ] Invariant cache hit.
[2024-05-21 16:11:39] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 878 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 404/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 915 ms. Remains : 500/511 places, 404/412 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-07 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 39 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
// Phase 1: matrix 402 rows 501 cols
[2024-05-21 16:11:39] [INFO ] Computed 110 invariants in 5 ms
[2024-05-21 16:11:39] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 16:11:39] [INFO ] Invariant cache hit.
[2024-05-21 16:11:40] [INFO ] Implicit Places using invariants and state equation in 466 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 679 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 731 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 38 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
[2024-05-21 16:11:40] [INFO ] Invariant cache hit.
[2024-05-21 16:11:41] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-21 16:11:41] [INFO ] Invariant cache hit.
[2024-05-21 16:11:41] [INFO ] Implicit Places using invariants and state equation in 421 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 751 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 810 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 32 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 1410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G(p2)))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 505 transition count 406
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 505 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 504 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 504 transition count 405
Applied a total of 14 rules in 27 ms. Remains 504 /511 variables (removed 7) and now considering 405/412 (removed 7) transitions.
// Phase 1: matrix 405 rows 504 cols
[2024-05-21 16:11:42] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:11:42] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 16:11:42] [INFO ] Invariant cache hit.
[2024-05-21 16:11:42] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 678 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 405/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 715 ms. Remains : 501/511 places, 405/412 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 762 reset in 234 ms.
Product exploration explored 100000 steps with 780 reset in 192 ms.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1060 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/501 stabilizing places and 181/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 451 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (260 resets) in 206 ms. (193 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (44 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
// Phase 1: matrix 405 rows 501 cols
[2024-05-21 16:11:44] [INFO ] Computed 107 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:44] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 31 ms to minimize.
[2024-05-21 16:11:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:11:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:11:45] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 135/495 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:11:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 401/896 variables, 495/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:11:47] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/896 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/905 variables, 5/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/905 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/906 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/906 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/906 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 639 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 135/495 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 401/896 variables, 495/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/896 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/896 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/896 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/905 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/905 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:11:49] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:11:50] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/905 variables, 9/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/905 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/906 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 663 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 52/52 constraints]
After SMT, in 5808ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 376 ms.
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 405/405 transitions.
Graph (trivial) has 227 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1053 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 346
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 444 transition count 240
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 318 transition count 240
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 618 place count 172 transition count 104
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 620 place count 171 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 622 place count 171 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 624 place count 169 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 625 place count 169 transition count 106
Applied a total of 625 rules in 41 ms. Remains 169 /501 variables (removed 332) and now considering 106/405 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 169/501 places, 106/405 transitions.
RANDOM walk for 40000 steps (1009 resets) in 219 ms. (181 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (326 resets) in 109 ms. (363 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (513 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
// Phase 1: matrix 106 rows 169 cols
[2024-05-21 16:11:50] [INFO ] Computed 77 invariants in 1 ms
[2024-05-21 16:11:50] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/132 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:11:51] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/162 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/167 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:11:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 106/273 variables, 167/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 13/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/275 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/275 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/275 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 169/169 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/132 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:11:51] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:11:51] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:11:51] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/162 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/167 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 106/273 variables, 167/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 13/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/275 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 169/169 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 106/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 168 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 167 transition count 104
Applied a total of 4 rules in 15 ms. Remains 167 /169 variables (removed 2) and now considering 104/106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 167/169 places, 104/106 transitions.
RANDOM walk for 40000 steps (1098 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (559 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 89 ms. (steps per millisecond=209 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 61 ms. (steps per millisecond=305 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 772 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 405/405 transitions.
Applied a total of 0 rules in 12 ms. Remains 501 /501 variables (removed 0) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 501 cols
[2024-05-21 16:11:53] [INFO ] Computed 107 invariants in 3 ms
[2024-05-21 16:11:53] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 16:11:53] [INFO ] Invariant cache hit.
[2024-05-21 16:11:53] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-21 16:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/103 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:02] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:03] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:12:04] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:05] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:06] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:12:07] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:12:08] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:09] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:12:10] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:12:10] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:12:10] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:12:10] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:12:10] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:13] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:12:13] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:13] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:13] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:12:14] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:12:15] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:12:16] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:12:16] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:16] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:12:16] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:12:16] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:12:17] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 16:12:18] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:12:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:12:18] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:12:19] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:12:19] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:12:19] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:12:20] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:20] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:12:20] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:12:20] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:12:20] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:12:21] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:22] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:22] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:12:22] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:12:22] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:12:23] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:12:23] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:23] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:12:23] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:12:24] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/906 variables, and 222 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/103 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 115/222 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:27] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:12:28] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:12:28] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:28] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:12:29] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:12:30] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:31] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-21 16:12:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:31] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:12:31] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:12:31] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:12:32] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:12:33] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:33] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:12:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:12:34] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:12:34] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:12:34] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:12:35] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:12:35] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:35] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:36] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:36] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:12:36] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:12:36] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 14 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:12:37] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:38] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:12:38] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:12:38] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:12:39] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:12:39] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:12:39] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:12:39] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:12:40] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:41] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:41] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:41] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:12:42] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:12:42] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:12:42] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:12:43] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:12:44] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:44] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:12:44] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:12:44] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:45] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:12:46] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:12:49] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:12:50] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:12:51] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:12:52] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:12:52] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:12:52] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:12:53] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:12:54] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 60290ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Finished structural reductions in LTL mode , in 1 iterations and 61201 ms. Remains : 501/501 places, 405/405 transitions.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1060 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/501 stabilizing places and 181/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 271 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (264 resets) in 284 ms. (140 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (47 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (46 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
[2024-05-21 16:12:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 135/495 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 401/896 variables, 495/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/905 variables, 5/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:55] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 2 ms to minimize.
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/905 variables, 3/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/905 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/906 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/906 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/906 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:12:56] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/495 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 401/896 variables, 495/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/896 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/896 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/896 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/905 variables, 5/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/905 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:12:57] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:12:58] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/905 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/905 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/906 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/906 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 637 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 3359ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 405/405 transitions.
Graph (trivial) has 228 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1053 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 346
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 444 transition count 240
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 318 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 317 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 317 transition count 239
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 620 place count 171 transition count 103
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 622 place count 170 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 624 place count 170 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 626 place count 168 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 627 place count 168 transition count 105
Applied a total of 627 rules in 57 ms. Remains 168 /501 variables (removed 333) and now considering 105/405 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 168/501 places, 105/405 transitions.
RANDOM walk for 40000 steps (1036 resets) in 238 ms. (167 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1575 steps (10 resets) in 7 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 17 factoid took 581 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 657 reset in 172 ms.
Product exploration explored 100000 steps with 663 reset in 192 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 405/405 transitions.
Graph (trivial) has 227 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1054 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 398
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 53 place count 495 transition count 452
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 127 place count 495 transition count 452
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 478 transition count 419
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 478 transition count 419
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 328 place count 478 transition count 419
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 366 place count 440 transition count 381
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 404 place count 440 transition count 381
Deduced a syphon composed of 237 places in 0 ms
Applied a total of 404 rules in 140 ms. Remains 440 /501 variables (removed 61) and now considering 381/405 (removed 24) transitions.
[2024-05-21 16:13:00] [INFO ] Redundant transitions in 17 ms returned []
Running 380 sub problems to find dead transitions.
// Phase 1: matrix 381 rows 440 cols
[2024-05-21 16:13:00] [INFO ] Computed 107 invariants in 17 ms
[2024-05-21 16:13:00] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 61/105 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 16:13:08] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:13:09] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
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
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem 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 TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/127 constraints. Problems are: Problem set: 150 solved, 230 unsolved
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 16:13:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/147 constraints. Problems are: Problem set: 213 solved, 167 unsolved
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 16:13:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 16:13:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/167 constraints. Problems are: Problem set: 241 solved, 139 unsolved
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:13:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:13:14] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/187 constraints. Problems are: Problem set: 256 solved, 124 unsolved
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:13:15] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:13:16] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:13:17] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/207 constraints. Problems are: Problem set: 258 solved, 122 unsolved
[2024-05-21 16:13:18] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/208 constraints. Problems are: Problem set: 258 solved, 122 unsolved
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:13:20] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:13:21] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:13:22] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:13:22] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:13:22] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:13:22] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 14/222 constraints. Problems are: Problem set: 258 solved, 122 unsolved
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:13:23] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 5/227 constraints. Problems are: Problem set: 258 solved, 122 unsolved
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:13:24] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:13:25] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 5/232 constraints. Problems are: Problem set: 258 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/232 constraints. Problems are: Problem set: 258 solved, 122 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 14 (OVERLAPS) 380/820 variables, 440/672 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/820 variables, 7/679 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/820 variables, 0/679 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 17 (OVERLAPS) 1/821 variables, 1/680 constraints. Problems are: Problem set: 279 solved, 101 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 680 constraints, problems are : Problem set: 279 solved, 101 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/440 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 279 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 185/387 variables, 61/61 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 125/186 constraints. Problems are: Problem set: 279 solved, 101 unsolved
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:13:31] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:13:32] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 20/206 constraints. Problems are: Problem set: 279 solved, 101 unsolved
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:13:33] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/208 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/208 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 51/438 variables, 46/254 constraints. Problems are: Problem set: 279 solved, 101 unsolved
[2024-05-21 16:13:34] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:13:35] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 3/257 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/257 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 380/818 variables, 438/695 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 7/702 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 101/803 constraints. Problems are: Problem set: 279 solved, 101 unsolved
[2024-05-21 16:13:41] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:13:42] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 2/805 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 0/805 constraints. Problems are: Problem set: 279 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 2/820 variables, 2/807 constraints. Problems are: Problem set: 279 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/821 variables, and 807 constraints, problems are : Problem set: 279 solved, 101 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/440 constraints, ReadFeed: 7/8 constraints, PredecessorRefiner: 101/380 constraints, Known Traps: 152/152 constraints]
After SMT, in 60429ms problems are : Problem set: 279 solved, 101 unsolved
Search for dead transitions found 279 dead transitions in 60446ms
Found 279 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 279 transitions
Dead transitions reduction (with SMT) removed 279 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 440/501 places, 102/405 transitions.
Graph (complete) has 778 edges and 440 vertex of which 203 are kept as prefixes of interest. Removing 237 places using SCC suffix rule.1 ms
Discarding 237 places :
Also discarding 0 output transitions
Ensure Unique test removed 34 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 169 transition count 114
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 14 ms. Remains 169 /440 variables (removed 271) and now considering 114/102 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 169/501 places, 114/405 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60639 ms. Remains : 169/501 places, 114/405 transitions.
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 405/405 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 501 cols
[2024-05-21 16:14:00] [INFO ] Computed 107 invariants in 4 ms
[2024-05-21 16:14:01] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 16:14:01] [INFO ] Invariant cache hit.
[2024-05-21 16:14:01] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-21 16:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/103 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:14:09] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:14:10] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:11] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:12] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:13] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:14:14] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:15] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:16] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:19] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:14:19] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:14:19] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:14:20] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:14:21] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:22] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:14:23] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:14:24] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:14:25] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:14:26] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:14:27] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:14:28] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:14:28] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:28] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:14:29] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:14:30] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 5 ms to minimize.
[2024-05-21 16:14:30] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/906 variables, and 227 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/103 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:34] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:35] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:14:36] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:37] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:14:38] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:14:39] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:14:40] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:14:40] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:14:40] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:41] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:14:41] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:14:41] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:14:42] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:14:43] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:14:44] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:14:44] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:14:45] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:14:46] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:14:47] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:14:47] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:14:47] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:14:47] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:14:47] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:48] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:14:49] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:50] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:14:51] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:51] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:14:51] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:14:52] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:14:53] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:14:53] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:14:53] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:53] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:14:53] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:14:54] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:14:54] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:14:54] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:14:54] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-21 16:14:54] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:14:55] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:14:56] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:14:57] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:14:58] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:14:59] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 20/367 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 16:15:00] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:15:00] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:15:01] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-05-21 16:15:01] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:01] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 60085ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60846 ms. Remains : 501/501 places, 405/405 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 199611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 402
Applied a total of 20 rules in 23 ms. Remains 501 /511 variables (removed 10) and now considering 402/412 (removed 10) transitions.
// Phase 1: matrix 402 rows 501 cols
[2024-05-21 16:15:01] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:15:02] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 16:15:02] [INFO ] Invariant cache hit.
[2024-05-21 16:15:02] [INFO ] Implicit Places using invariants and state equation in 419 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 612 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/511 places, 402/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 642 ms. Remains : 498/511 places, 402/412 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 1797 reset in 137 ms.
Stack based approach found an accepted trace after 557 steps with 10 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Graph (trivial) has 237 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1077 edges and 505 vertex of which 504 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 503 transition count 348
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 448 transition count 348
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 112 place count 448 transition count 242
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 344 place count 322 transition count 242
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 351 place count 315 transition count 235
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 315 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 234
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 360 place count 314 transition count 234
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 629 place count 175 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 631 place count 174 transition count 108
Applied a total of 631 rules in 29 ms. Remains 174 /511 variables (removed 337) and now considering 108/412 (removed 304) transitions.
// Phase 1: matrix 108 rows 174 cols
[2024-05-21 16:15:02] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 16:15:02] [INFO ] Implicit Places using invariants in 155 ms returned [1, 2, 3, 4, 5, 8, 9, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 156 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/511 places, 108/412 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 152/511 places, 108/412 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 17790 reset in 220 ms.
Product exploration explored 100000 steps with 17885 reset in 200 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (7890 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2426 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 556 steps, run visited all 1 properties in 5 ms. (steps per millisecond=111 )
Probabilistic random walk after 556 steps, saw 264 distinct states, run finished after 5 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 152 cols
[2024-05-21 16:15:03] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 16:15:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 16:15:03] [INFO ] Invariant cache hit.
[2024-05-21 16:15:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:15:04] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [3, 5, 6, 7, 22, 24, 26, 33, 35, 37, 39, 41, 48, 50, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 132, 138, 140]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 266 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/152 places, 108/108 transitions.
Graph (complete) has 294 edges and 114 vertex of which 105 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 105 transition count 91
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 92 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 89 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 89 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 89 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 87 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 84 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 84 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 61 place count 73 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 71 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 71 transition count 72
Applied a total of 66 rules in 11 ms. Remains 71 /114 variables (removed 43) and now considering 72/108 (removed 36) transitions.
// Phase 1: matrix 72 rows 71 cols
[2024-05-21 16:15:04] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 16:15:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 16:15:04] [INFO ] Invariant cache hit.
[2024-05-21 16:15:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:15:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/152 places, 72/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 411 ms. Remains : 70/152 places, 72/108 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8070 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2450 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 292 steps, run visited all 1 properties in 4 ms. (steps per millisecond=73 )
Probabilistic random walk after 292 steps, saw 157 distinct states, run finished after 4 ms. (steps per millisecond=73 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18176 reset in 91 ms.
Product exploration explored 100000 steps with 18107 reset in 86 ms.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 70 cols
[2024-05-21 16:15:04] [INFO ] Computed 11 invariants in 0 ms
[2024-05-21 16:15:05] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-21 16:15:05] [INFO ] Invariant cache hit.
[2024-05-21 16:15:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:15:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-21 16:15:05] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-21 16:15:05] [INFO ] Invariant cache hit.
[2024-05-21 16:15:05] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 4 (OVERLAPS) 71/141 variables, 70/81 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 4/85 constraints. Problems are: Problem set: 4 solved, 63 unsolved
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:15:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 6/91 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/91 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/91 constraints. Problems are: Problem set: 4 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/142 variables, and 91 constraints, problems are : Problem set: 4 solved, 63 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 6/12 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 5/17 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 71/141 variables, 70/87 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 4/91 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 63/154 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/142 variables, and 154 constraints, problems are : Problem set: 4 solved, 63 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 63/67 constraints, Known Traps: 6/6 constraints]
After SMT, in 2798ms problems are : Problem set: 4 solved, 63 unsolved
Search for dead transitions found 4 dead transitions in 2799ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 68/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-21 16:15:08] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3536 ms. Remains : 70/70 places, 68/72 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 5747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 404
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 502 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 502 transition count 403
Applied a total of 18 rules in 49 ms. Remains 502 /511 variables (removed 9) and now considering 403/412 (removed 9) transitions.
// Phase 1: matrix 403 rows 502 cols
[2024-05-21 16:15:08] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:15:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 16:15:08] [INFO ] Invariant cache hit.
[2024-05-21 16:15:09] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 714 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 499/511 places, 403/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 499/511 places, 403/412 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1057 edges and 499 vertex of which 498 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Detected a total of 207/499 stabilizing places and 179/403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 1184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 405
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 404
Applied a total of 16 rules in 22 ms. Remains 503 /511 variables (removed 8) and now considering 404/412 (removed 8) transitions.
// Phase 1: matrix 404 rows 503 cols
[2024-05-21 16:15:09] [INFO ] Computed 110 invariants in 3 ms
[2024-05-21 16:15:09] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 16:15:09] [INFO ] Invariant cache hit.
[2024-05-21 16:15:10] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 713 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/511 places, 404/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 743 ms. Remains : 500/511 places, 404/412 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Support contains 6 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 405
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 404
Applied a total of 16 rules in 23 ms. Remains 503 /511 variables (removed 8) and now considering 404/412 (removed 8) transitions.
// Phase 1: matrix 404 rows 503 cols
[2024-05-21 16:15:10] [INFO ] Computed 110 invariants in 9 ms
[2024-05-21 16:15:10] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 16:15:10] [INFO ] Invariant cache hit.
[2024-05-21 16:15:11] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 714 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 404/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 501/511 places, 404/412 transitions.
Stuttering acceptance computed with spot in 693 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 657 reset in 185 ms.
Product exploration explored 100000 steps with 659 reset in 292 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1063 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 718 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (262 resets) in 1117 ms. (35 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 522154 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :16 out of 18
Probabilistic random walk after 522154 steps, saw 87124 distinct states, run finished after 3008 ms. (steps per millisecond=173 ) properties seen :16
// Phase 1: matrix 404 rows 501 cols
[2024-05-21 16:15:17] [INFO ] Computed 108 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf16 is UNSAT
After SMT solving in domain Real declared 126/905 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 4/59 constraints, Generalized P Invariants (flows): 0/49 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p3 (NOT p2))), (G (OR p0 p1 p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p1 p3 p2))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT p0)), (F (NOT (OR p0 p3 p2)))]
Knowledge based reduction with 9 factoid took 961 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 856 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 780 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-21 16:15:19] [INFO ] Invariant cache hit.
[2024-05-21 16:15:19] [INFO ] [Real]Absence check using 59 positive place invariants in 29 ms returned sat
[2024-05-21 16:15:19] [INFO ] [Real]Absence check using 59 positive and 49 generalized place invariants in 38 ms returned sat
[2024-05-21 16:15:21] [INFO ] [Real]Absence check using state equation in 1450 ms returned sat
[2024-05-21 16:15:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:15:21] [INFO ] [Nat]Absence check using 59 positive place invariants in 45 ms returned sat
[2024-05-21 16:15:21] [INFO ] [Nat]Absence check using 59 positive and 49 generalized place invariants in 42 ms returned sat
[2024-05-21 16:15:22] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2024-05-21 16:15:22] [INFO ] Computed and/alt/rep : 401/707/401 causal constraints (skipped 2 transitions) in 38 ms.
[2024-05-21 16:15:25] [INFO ] Added : 288 causal constraints over 58 iterations in 2647 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 404/404 transitions.
Applied a total of 0 rules in 14 ms. Remains 501 /501 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-21 16:15:25] [INFO ] Invariant cache hit.
[2024-05-21 16:15:25] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 16:15:25] [INFO ] Invariant cache hit.
[2024-05-21 16:15:26] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Running 403 sub problems to find dead transitions.
[2024-05-21 16:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/104 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:35] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:15:36] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/128 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:15:37] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:15:38] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 5 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 5 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:15:39] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/148 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:40] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:15:41] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:42] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/168 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:45] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:15:46] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/188 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:15:47] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:48] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 3 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:15:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/208 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:15:50] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:51] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:52] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:15:53] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/228 constraints. Problems are: Problem set: 1 solved, 402 unsolved
[2024-05-21 16:15:56] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:15:56] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 1 solved, 402 unsolved
Search for dead transitions found 1 dead transitions in 30148ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/501 places, 403/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31007 ms. Remains : 501/501 places, 403/404 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1061 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 787 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (263 resets) in 859 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 206 ms. (193 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 154 ms. (258 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (46 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (44 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
// Phase 1: matrix 403 rows 501 cols
[2024-05-21 16:15:58] [INFO ] Computed 109 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:15:58] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:15:58] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:15:59] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 133/493 variables, 49/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:16:00] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/495 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 399/894 variables, 495/625 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:01] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:16:01] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:16:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:16:01] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:16:01] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 5/630 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 9/903 variables, 5/635 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:16:02] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:16:03] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:16:03] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/903 variables, 12/647 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/903 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/904 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/904 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/904 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 904/904 variables, and 648 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 120/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:03] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:16:03] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 3 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 3 ms to minimize.
[2024-05-21 16:16:04] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:16:05] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:16:06] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:07] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 133/493 variables, 49/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 87 places in 180 ms of which 4 ms to minimize.
[2024-05-21 16:16:08] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 10146ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 403/403 transitions.
Graph (trivial) has 225 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1054 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 495 transition count 346
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 446 transition count 346
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 446 transition count 239
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 319 transition count 239
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 613 place count 174 transition count 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 615 place count 173 transition count 109
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 619 place count 173 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 623 place count 169 transition count 105
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 628 place count 169 transition count 105
Applied a total of 628 rules in 32 ms. Remains 169 /501 variables (removed 332) and now considering 105/403 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 169/501 places, 105/403 transitions.
RANDOM walk for 1742 steps (42 resets) in 24 ms. (69 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F p1), (F (NOT (OR p0 p1 p3))), (F p2), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 689 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 693 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 663 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-21 16:16:10] [INFO ] Invariant cache hit.
[2024-05-21 16:16:11] [INFO ] [Real]Absence check using 59 positive place invariants in 22 ms returned sat
[2024-05-21 16:16:11] [INFO ] [Real]Absence check using 59 positive and 50 generalized place invariants in 27 ms returned sat
[2024-05-21 16:16:12] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2024-05-21 16:16:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:16:12] [INFO ] [Nat]Absence check using 59 positive place invariants in 46 ms returned sat
[2024-05-21 16:16:12] [INFO ] [Nat]Absence check using 59 positive and 50 generalized place invariants in 45 ms returned sat
[2024-05-21 16:16:13] [INFO ] [Nat]Absence check using state equation in 1009 ms returned sat
[2024-05-21 16:16:13] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-05-21 16:16:13] [INFO ] Computed and/alt/rep : 401/712/401 causal constraints (skipped 1 transitions) in 31 ms.
[2024-05-21 16:16:16] [INFO ] Added : 284 causal constraints over 57 iterations in 2241 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 721 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 661 reset in 272 ms.
Product exploration explored 100000 steps with 660 reset in 252 ms.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-21 16:16:17] [INFO ] Invariant cache hit.
[2024-05-21 16:16:17] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 16:16:17] [INFO ] Invariant cache hit.
[2024-05-21 16:16:18] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-05-21 16:16:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/105 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:26] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:26] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:16:26] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:16:26] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:16:27] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:16:28] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:16:29] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:16:30] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:16:31] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:16:31] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:16:31] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:16:31] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:16:31] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:16:32] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:16:33] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:16:33] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:16:33] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:16:33] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:16:33] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:16:34] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:16:34] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:16:34] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:16:34] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:34] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:16:35] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:16:35] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:16:35] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:16:35] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:38] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:16:38] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:16:39] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:16:40] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:16:41] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:16:42] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:16:43] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:16:44] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:16:44] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:16:44] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:16:44] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:16:45] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:16:46] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:16:47] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 2.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 2.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/904 variables, and 229 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/105 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/229 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:52] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:16:52] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:16:52] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:16:52] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:16:52] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:16:53] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:16:53] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:16:53] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:16:53] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:16:54] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:16:55] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:16:55] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:16:55] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:16:55] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:16:56] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:16:56] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:16:56] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:16:56] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:16:57] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:16:58] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:16:58] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:16:58] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:16:58] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:16:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:16:59] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:16:59] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:16:59] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:17:00] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:17:00] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:17:01] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:17:02] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:17:02] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:17:02] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:17:02] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:17:02] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:17:03] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:17:03] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:17:03] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:17:03] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:17:04] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:17:04] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:17:05] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:17:05] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:17:06] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:17:06] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:17:06] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:17:06] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:17:07] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:17:07] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:17:08] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:17:09] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:17:10] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:17:10] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:17:10] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:17:10] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:17:11] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:17:11] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:17:12] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:17:12] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:17:12] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:17:13] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:17:13] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:17:13] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:17:14] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:17:14] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:17:14] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:17:14] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:17:15] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:17:15] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:17:15] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:17:15] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:17:16] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:17:17] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:17:17] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:17:17] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:17:17] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:17:18] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:17:18] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:17:18] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
SMT process timed out in 60183ms, After SMT, problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 60984 ms. Remains : 501/501 places, 403/403 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 127990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G(p2)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-17-LTLFireability-10
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Graph (trivial) has 234 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1077 edges and 505 vertex of which 504 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 503 transition count 349
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 449 transition count 349
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 110 place count 449 transition count 243
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 342 place count 323 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 346 place count 319 transition count 239
Iterating global reduction 2 with 4 rules applied. Total rules applied 350 place count 319 transition count 239
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 628 place count 175 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 630 place count 174 transition count 109
Applied a total of 630 rules in 61 ms. Remains 174 /511 variables (removed 337) and now considering 109/412 (removed 303) transitions.
// Phase 1: matrix 109 rows 174 cols
[2024-05-21 16:17:19] [INFO ] Computed 80 invariants in 3 ms
[2024-05-21 16:17:19] [INFO ] Implicit Places using invariants in 184 ms returned [1, 2, 3, 4, 5, 8, 9, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 186 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 152/511 places, 109/412 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 252 ms. Remains : 152/511 places, 109/412 transitions.
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 15448 reset in 230 ms.
Product exploration explored 100000 steps with 15494 reset in 255 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/152 stabilizing places and 26/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1195 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (6370 resets) in 271 ms. (147 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (2184 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2000 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1831 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
// Phase 1: matrix 109 rows 152 cols
[2024-05-21 16:17:21] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 16:17:21] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/113 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/149 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:17:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 108/258 variables, 150/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/260 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/260 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 152/152 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/113 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/149 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 108/258 variables, 150/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/260 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/260 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 152/152 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 109/109 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 152 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 152 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 150 transition count 106
Applied a total of 6 rules in 15 ms. Remains 150 /152 variables (removed 2) and now considering 106/109 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 150/152 places, 106/109 transitions.
RANDOM walk for 40000 steps (1035 resets) in 408 ms. (97 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (300 resets) in 75 ms. (526 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (493 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
// Phase 1: matrix 106 rows 150 cols
[2024-05-21 16:17:22] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 16:17:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/114 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/148 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:17:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/254 variables, 148/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/256 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/256 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 150/150 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/114 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/148 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/254 variables, 148/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/256 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/256 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 150/150 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 106/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 150 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 149 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 148 transition count 104
Applied a total of 4 rules in 7 ms. Remains 148 /150 variables (removed 2) and now considering 104/106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 148/150 places, 104/106 transitions.
RANDOM walk for 40000 steps (1112 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (542 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 53 ms. (steps per millisecond=351 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 47 ms. (steps per millisecond=396 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 1405 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 152 cols
[2024-05-21 16:17:24] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 16:17:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 16:17:24] [INFO ] Invariant cache hit.
[2024-05-21 16:17:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:17:25] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [3, 4, 5, 6, 20, 22, 24, 31, 33, 38, 40, 49, 51, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 132, 138, 140, 142]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 291 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/152 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 108 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 108 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 107 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 107 transition count 101
Applied a total of 14 rules in 5 ms. Remains 107 /114 variables (removed 7) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-21 16:17:25] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 16:17:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 16:17:25] [INFO ] Invariant cache hit.
[2024-05-21 16:17:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:17:25] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/152 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 107/152 places, 101/109 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 21 stable transitions
Detected a total of 19/107 stabilizing places and 21/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 1091 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (6385 resets) in 107 ms. (370 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (2218 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2070 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2024-05-21 16:17:26] [INFO ] Invariant cache hit.
[2024-05-21 16:17:26] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/38 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 48/86 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 94/180 variables, 43/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 27/207 variables, 26/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/208 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/38 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 48/86 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 94/180 variables, 43/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 27/207 variables, 26/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 2 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 262 edges and 107 vertex of which 97 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 97 transition count 83
Reduce places removed 12 places and 0 transitions.
Graph (complete) has 214 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 84 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 84 transition count 82
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 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 72 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 70 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 70 transition count 71
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 70 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 68 transition count 69
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 68 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 66 place count 64 transition count 65
Applied a total of 66 rules in 11 ms. Remains 64 /107 variables (removed 43) and now considering 65/101 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 64/107 places, 65/101 transitions.
RANDOM walk for 40000 steps (1722 resets) in 46 ms. (851 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2956 steps (41 resets) in 7 ms. (369 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 1757 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14692 reset in 94 ms.
Product exploration explored 100000 steps with 14588 reset in 127 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 278 edges and 107 vertex of which 98 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 98 transition count 97
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 98 transition count 99
Deduced a syphon composed of 19 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 98 transition count 97
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 22 rules in 8 ms. Remains 98 /107 variables (removed 9) and now considering 97/101 (removed 4) transitions.
[2024-05-21 16:17:29] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 97 rows 98 cols
[2024-05-21 16:17:29] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 16:17:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 16:17:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 16:17:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 16:17:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/18 constraints. Problems are: Problem set: 3 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 89 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 5 (OVERLAPS) 96/194 variables, 98/116 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 4/120 constraints. Problems are: Problem set: 24 solved, 68 unsolved
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 4/124 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/124 constraints. Problems are: Problem set: 24 solved, 68 unsolved
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:17:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:17:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:17:32] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/194 variables, 4/128 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/128 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/128 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/195 variables, and 128 constraints, problems are : Problem set: 24 solved, 68 unsolved in 3163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 24 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 8/10 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 4/82 variables, 9/19 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/21 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 3/24 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/24 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 3/85 variables, 2/26 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/26 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 96/181 variables, 85/111 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 4/115 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 68/183 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/183 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 13/194 variables, 13/196 constraints. Problems are: Problem set: 24 solved, 68 unsolved
[2024-05-21 16:17:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:17:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 2/198 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/198 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 16 (OVERLAPS) 0/194 variables, 0/198 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/195 variables, and 198 constraints, problems are : Problem set: 24 solved, 68 unsolved in 3870 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 68/92 constraints, Known Traps: 13/13 constraints]
After SMT, in 7078ms problems are : Problem set: 24 solved, 68 unsolved
Search for dead transitions found 24 dead transitions in 7080ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/107 places, 73/101 transitions.
Graph (complete) has 247 edges and 98 vertex of which 79 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 75 /98 variables (removed 23) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/107 places, 73/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7108 ms. Remains : 75/107 places, 73/101 transitions.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-21 16:17:36] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 16:17:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 16:17:36] [INFO ] Invariant cache hit.
[2024-05-21 16:17:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:17:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 16:17:37] [INFO ] Invariant cache hit.
[2024-05-21 16:17:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 100/207 variables, 107/127 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 4/131 constraints. Problems are: Problem set: 4 solved, 92 unsolved
[2024-05-21 16:17:37] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-21 16:17:38] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:17:38] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:17:38] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 4/135 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/208 variables, and 135 constraints, problems are : Problem set: 4 solved, 92 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 4/15 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 9/24 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 100/207 variables, 107/131 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 4/135 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 92/227 constraints. Problems are: Problem set: 4 solved, 92 unsolved
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:17:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 8/235 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/235 constraints. Problems are: Problem set: 4 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/235 constraints. Problems are: Problem set: 4 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/208 variables, and 235 constraints, problems are : Problem set: 4 solved, 92 unsolved in 5208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 92/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 7321ms problems are : Problem set: 4 solved, 92 unsolved
Search for dead transitions found 4 dead transitions in 7322ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/107 places, 97/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7532 ms. Remains : 107/107 places, 97/101 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 25821 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-17-LTLFireability-15
Stuttering acceptance computed with spot in 730 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 511 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 511/511 places, 412/412 transitions.
Graph (trivial) has 233 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1077 edges and 505 vertex of which 504 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 503 transition count 350
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 450 transition count 350
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 108 place count 450 transition count 244
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 340 place count 324 transition count 244
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 318 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 318 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 352 place count 318 transition count 237
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 354 place count 317 transition count 237
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 624 place count 177 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 626 place count 176 transition count 111
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 632 place count 176 transition count 111
Applied a total of 632 rules in 41 ms. Remains 176 /511 variables (removed 335) and now considering 111/412 (removed 301) transitions.
// Phase 1: matrix 111 rows 176 cols
[2024-05-21 16:17:45] [INFO ] Computed 80 invariants in 2 ms
[2024-05-21 16:17:45] [INFO ] Implicit Places using invariants in 250 ms returned [1, 2, 3, 4, 5, 8, 9, 27, 28, 29, 30, 37, 38, 39, 47, 48, 49, 50, 51, 52, 53]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 252 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 155/511 places, 111/412 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 295 ms. Remains : 155/511 places, 111/412 transitions.
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 1146 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 16:17:45] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:17:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 16:17:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 511 places, 412 transitions and 1242 arcs took 5 ms.
Total runtime 442020 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 511
TRANSITIONS: 412
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.006s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 6756
MODEL NAME: /home/mcc/execution/414/model
511 places, 412 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-17-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-17-LTLFireability-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-17-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716309591531

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-17"
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-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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