Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225834550

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:36] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 07:10:36] [INFO ] Transformed 624 places.
[2024-06-01 07:10:36] [INFO ] Transformed 564 transitions.
[2024-06-01 07:10:36] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:36] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 522 transition count 467
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 522 transition count 467
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 228 place count 477 transition count 422
Iterating global reduction 1 with 45 rules applied. Total rules applied 273 place count 477 transition count 422
Applied a total of 273 rules in 110 ms. Remains 477 /616 variables (removed 139) and now considering 422/556 (removed 134) transitions.
// Phase 1: matrix 422 rows 477 cols
[2024-06-01 07:10:36] [INFO ] Computed 94 invariants in 40 ms
[2024-06-01 07:10:36] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-06-01 07:10:36] [INFO ] Invariant cache hit.
[2024-06-01 07:10:37] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-06-01 07:10:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 25 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 92 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 20/114 constraints. Problems are: Problem set: 19 solved, 402 unsolved
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 6 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/134 constraints. Problems are: Problem set: 19 solved, 402 unsolved
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 3 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 4 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 7 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
Problem TDEAD321 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/154 constraints. Problems are: Problem set: 20 solved, 401 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/174 constraints. Problems are: Problem set: 23 solved, 398 unsolved
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 101 places in 140 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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.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 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/899 variables, and 178 constraints, problems are : Problem set: 23 solved, 398 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/477 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 23 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 37/37 constraints. Problems are: Problem set: 23 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/37 constraints. Problems are: Problem set: 23 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 55/92 constraints. Problems are: Problem set: 23 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/94 constraints. Problems are: Problem set: 23 solved, 398 unsolved
Problem TDEAD333 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 84/178 constraints. Problems are: Problem set: 26 solved, 395 unsolved
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/198 constraints. Problems are: Problem set: 26 solved, 395 unsolved
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/218 constraints. Problems are: Problem set: 26 solved, 395 unsolved
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/238 constraints. Problems are: Problem set: 34 solved, 387 unsolved
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/258 constraints. Problems are: Problem set: 34 solved, 387 unsolved
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 20/278 constraints. Problems are: Problem set: 34 solved, 387 unsolved
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 20/298 constraints. Problems are: Problem set: 34 solved, 387 unsolved
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 20/318 constraints. Problems are: Problem set: 35 solved, 386 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 4 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/899 variables, and 334 constraints, problems are : Problem set: 35 solved, 386 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/477 constraints, PredecessorRefiner: 0/421 constraints, Known Traps: 240/240 constraints]
After SMT, in 60352ms problems are : Problem set: 35 solved, 386 unsolved
Search for dead transitions found 35 dead transitions in 60413ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/616 places, 387/556 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 387
Applied a total of 3 rules in 16 ms. Remains 474 /477 variables (removed 3) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 474 cols
[2024-06-01 07:11:38] [INFO ] Computed 99 invariants in 8 ms
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 474/616 places, 387/556 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62544 ms. Remains : 474/616 places, 387/556 transitions.
Support contains 42 out of 474 places after structural reductions.
[2024-06-01 07:11:39] [INFO ] Flatten gal took : 58 ms
[2024-06-01 07:11:39] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:11:39] [INFO ] Input system was already deterministic with 387 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (270 resets) in 2405 ms. (16 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
[2024-06-01 07:11:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 173/200 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 155/355 variables, 36/56 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 6 (OVERLAPS) 110/465 variables, 43/99 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 381/846 variables, 465/564 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/564 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 13/859 variables, 7/571 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 2/861 variables, 2/573 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/573 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/573 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 573 constraints, problems are : Problem set: 3 solved, 14 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 155/176 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 178/354 variables, 42/56 constraints. Problems are: Problem set: 3 solved, 14 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 15 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/76 constraints. Problems are: Problem set: 3 solved, 14 unsolved
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 20/96 constraints. Problems are: Problem set: 3 solved, 14 unsolved
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 6462ms, After SMT, problems are : Problem set: 3 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 387/387 transitions.
Graph (complete) has 1002 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 473 transition count 341
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 428 transition count 336
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 423 transition count 336
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 101 place count 423 transition count 242
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 303 place count 315 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 308 place count 310 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 313 place count 310 transition count 237
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 7 ms
Ensure Unique test removed 9 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 558 place count 183 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 183 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 561 place count 182 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 563 place count 182 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 565 place count 180 transition count 120
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 574 place count 180 transition count 120
Applied a total of 574 rules in 103 ms. Remains 180 /474 variables (removed 294) and now considering 120/387 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 180/474 places, 120/387 transitions.
RANDOM walk for 40000 steps (3258 resets) in 1037 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (868 resets) in 258 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (861 resets) in 258 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (875 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (854 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (862 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (856 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (730 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (872 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (862 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (872 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (866 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (859 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (900 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (788 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 737871 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :12 out of 14
Probabilistic random walk after 737871 steps, saw 137076 distinct states, run finished after 3005 ms. (steps per millisecond=245 ) properties seen :12
// Phase 1: matrix 120 rows 180 cols
[2024-06-01 07:11:50] [INFO ] Computed 76 invariants in 7 ms
[2024-06-01 07:11:50] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/152 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/177 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 120/297 variables, 177/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/300 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 180/180 constraints, ReadFeed: 6/6 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/152 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 6 (OVERLAPS) 25/177 variables, 19/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 120/297 variables, 177/260 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 6/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/300 variables, 3/269 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 1/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 300/300 variables, and 271 constraints, problems are : Problem set: 2 solved, 0 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 180/180 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 697ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1002 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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)||G(F((p1||G(p2))))))))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 467 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 467 transition count 380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 463 transition count 376
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 463 transition count 376
Applied a total of 22 rules in 24 ms. Remains 463 /474 variables (removed 11) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 463 cols
[2024-06-01 07:11:52] [INFO ] Computed 99 invariants in 4 ms
[2024-06-01 07:11:52] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 07:11:52] [INFO ] Invariant cache hit.
[2024-06-01 07:11:52] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-01 07:11:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.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 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.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 1.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 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 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/839 variables, and 226 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/463 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 127/127 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 127/226 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/246 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/266 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/286 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 20 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/306 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/839 variables, and 386 constraints, problems are : Problem set: 1 solved, 374 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/463 constraints, PredecessorRefiner: 0/375 constraints, Known Traps: 287/287 constraints]
After SMT, in 60158ms problems are : Problem set: 1 solved, 374 unsolved
Search for dead transitions found 1 dead transitions in 60170ms
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 : 463/474 places, 375/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 463 /463 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60870 ms. Remains : 463/474 places, 375/387 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00
Product exploration explored 100000 steps with 713 reset in 365 ms.
Stack based approach found an accepted trace after 15362 steps with 109 reset with depth 175 and stack size 175 in 35 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 61786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&X(X(G(p1))))))))'
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Graph (trivial) has 220 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 996 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 467 transition count 327
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 415 transition count 327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 106 place count 415 transition count 231
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 314 place count 303 transition count 231
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 297 transition count 225
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 297 transition count 225
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 588 place count 160 transition count 100
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 590 place count 159 transition count 104
Applied a total of 590 rules in 73 ms. Remains 159 /474 variables (removed 315) and now considering 104/387 (removed 283) transitions.
// Phase 1: matrix 104 rows 159 cols
[2024-06-01 07:12:53] [INFO ] Computed 71 invariants in 2 ms
[2024-06-01 07:12:54] [INFO ] Implicit Places using invariants in 250 ms returned [1, 2, 3, 4, 5, 6, 7, 16, 17, 21, 22, 23, 24, 25, 26, 40, 41, 42, 43, 44]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 253 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/474 places, 104/387 transitions.
Applied a total of 0 rules in 16 ms. Remains 139 /139 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 139/474 places, 104/387 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01
Product exploration explored 100000 steps with 13209 reset in 351 ms.
Product exploration explored 100000 steps with 13201 reset in 220 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/139 stabilizing places and 12/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 430 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5674 resets) in 530 ms. (75 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1633 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
// Phase 1: matrix 104 rows 139 cols
[2024-06-01 07:12:55] [INFO ] Computed 51 invariants in 1 ms
[2024-06-01 07:12:55] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/118 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/136 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/239 variables, 136/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/242 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/243 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 139/139 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/118 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/136 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/239 variables, 136/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/242 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 242/243 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 139/139 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 327ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 521 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 3 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 07:12:56] [INFO ] Invariant cache hit.
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 07:12:56] [INFO ] Invariant cache hit.
[2024-06-01 07:12:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [3, 5, 9, 12, 22, 26, 28, 30, 31, 32, 34, 36, 38, 40, 42, 48, 50, 52, 59, 61, 63, 65, 67, 69, 71, 73, 75, 79, 81, 83, 85, 87, 89, 123]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 225 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/139 places, 104/104 transitions.
Graph (complete) has 248 edges and 105 vertex of which 94 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 94 transition count 88
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 83 transition count 88
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 78 transition count 81
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 78 transition count 81
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 78 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 39 place count 75 transition count 78
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 68 place count 59 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 58 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 58 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 57 transition count 63
Applied a total of 72 rules in 26 ms. Remains 57 /105 variables (removed 48) and now considering 63/104 (removed 41) transitions.
// Phase 1: matrix 63 rows 57 cols
[2024-06-01 07:12:56] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants in 35 ms returned [51, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/139 places, 63/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 62
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 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 60
Applied a total of 6 rules in 5 ms. Remains 52 /55 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 52 cols
[2024-06-01 07:12:56] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 07:12:56] [INFO ] Invariant cache hit.
[2024-06-01 07:12:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 51/139 places, 60/104 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 59
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 50 cols
[2024-06-01 07:12:56] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:12:56] [INFO ] Invariant cache hit.
[2024-06-01 07:12:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:12:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 50/139 places, 59/104 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 504 ms. Remains : 50/139 places, 59/104 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 24556 steps (3539 resets) in 76 ms. (318 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13346 reset in 206 ms.
Product exploration explored 100000 steps with 13386 reset in 228 ms.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 59/59 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 50 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 58
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 48 transition count 57
Applied a total of 4 rules in 5 ms. Remains 48 /50 variables (removed 2) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 48 cols
[2024-06-01 07:12:57] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 07:12:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 07:12:57] [INFO ] Invariant cache hit.
[2024-06-01 07:12:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:12:57] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/50 places, 57/59 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 47 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 56
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 46 cols
[2024-06-01 07:12:57] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 07:12:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 07:12:57] [INFO ] Invariant cache hit.
[2024-06-01 07:12:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:12:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/50 places, 56/59 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 46/50 places, 56/59 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 4096 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 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Graph (trivial) has 221 edges and 474 vertex of which 6 / 474 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 996 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 467 transition count 328
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 416 transition count 328
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 104 place count 416 transition count 229
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 319 place count 300 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 324 place count 295 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 329 place count 295 transition count 224
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 591 place count 158 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 593 place count 157 transition count 103
Applied a total of 593 rules in 37 ms. Remains 157 /474 variables (removed 317) and now considering 103/387 (removed 284) transitions.
// Phase 1: matrix 103 rows 157 cols
[2024-06-01 07:12:57] [INFO ] Computed 70 invariants in 1 ms
[2024-06-01 07:12:58] [INFO ] Implicit Places using invariants in 286 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 38, 39, 40, 41, 42]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 288 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/474 places, 103/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 137/474 places, 103/387 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-05
Stuttering criterion allowed to conclude after 29 steps with 5 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-05 finished in 415 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(G(p0))||F(p1))))'
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 467 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 467 transition count 380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 463 transition count 376
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 463 transition count 376
Applied a total of 22 rules in 31 ms. Remains 463 /474 variables (removed 11) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 463 cols
[2024-06-01 07:12:58] [INFO ] Computed 99 invariants in 3 ms
[2024-06-01 07:12:58] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 07:12:58] [INFO ] Invariant cache hit.
[2024-06-01 07:12:59] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-01 07:12:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 106 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/839 variables, and 227 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/463 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 128/227 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
Problem TDEAD315 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/307 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/327 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 17 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 20/347 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 20/367 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 20/387 constraints. Problems are: Problem set: 1 solved, 374 unsolved
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 102 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 17 ms to minimize.
SMT process timed out in 60151ms, After SMT, problems are : Problem set: 1 solved, 374 unsolved
Search for dead transitions found 1 dead transitions in 60154ms
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 : 463/474 places, 375/387 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60975 ms. Remains : 463/474 places, 375/387 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 61091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Graph (trivial) has 223 edges and 474 vertex of which 6 / 474 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 996 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 467 transition count 328
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 416 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 414 transition count 326
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 108 place count 414 transition count 226
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 325 place count 297 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 332 place count 290 transition count 219
Iterating global reduction 3 with 7 rules applied. Total rules applied 339 place count 290 transition count 219
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 591 place count 158 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 157 transition count 103
Applied a total of 593 rules in 45 ms. Remains 157 /474 variables (removed 317) and now considering 103/387 (removed 284) transitions.
// Phase 1: matrix 103 rows 157 cols
[2024-06-01 07:13:59] [INFO ] Computed 70 invariants in 1 ms
[2024-06-01 07:13:59] [INFO ] Implicit Places using invariants in 172 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 20, 21, 22, 23, 26, 40, 41, 42, 43, 44]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 174 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/474 places, 103/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 139/474 places, 103/387 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-08
Product exploration explored 100000 steps with 15171 reset in 192 ms.
Product exploration explored 100000 steps with 15266 reset in 227 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/139 stabilizing places and 12/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 488 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (6681 resets) in 236 ms. (168 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (2234 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2123 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2405 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
// Phase 1: matrix 103 rows 139 cols
[2024-06-01 07:14:01] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 07:14:01] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 106/116 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 20/136 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 102/238 variables, 136/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/241 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/241 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 139/139 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 106/116 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 20/136 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 102/238 variables, 136/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/241 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/241 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 139/139 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1531 steps, including 78 resets, run visited all 3 properties in 7 ms. (steps per millisecond=218 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 13 factoid took 523 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-08 finished in 2966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (G(!p1)||X(G(p2)))))'
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 468 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 468 transition count 381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 464 transition count 377
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 464 transition count 377
Applied a total of 20 rules in 18 ms. Remains 464 /474 variables (removed 10) and now considering 377/387 (removed 10) transitions.
// Phase 1: matrix 377 rows 464 cols
[2024-06-01 07:14:02] [INFO ] Computed 99 invariants in 4 ms
[2024-06-01 07:14:02] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 07:14:02] [INFO ] Invariant cache hit.
[2024-06-01 07:14:03] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-06-01 07:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/464 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 5 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/841 variables, and 227 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/464 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 128/227 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 20/347 constraints. Problems are: Problem set: 1 solved, 375 unsolved
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 1 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 20/367 constraints. Problems are: Problem set: 1 solved, 375 unsolved
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/841 variables, and 373 constraints, problems are : Problem set: 1 solved, 375 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 0/376 constraints, Known Traps: 274/274 constraints]
After SMT, in 60104ms problems are : Problem set: 1 solved, 375 unsolved
Search for dead transitions found 1 dead transitions in 60123ms
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 : 464/474 places, 376/387 transitions.
Applied a total of 0 rules in 5 ms. Remains 464 /464 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60952 ms. Remains : 464/474 places, 376/387 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 685 reset in 294 ms.
Product exploration explored 100000 steps with 680 reset in 266 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 981 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/464 stabilizing places and 117/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 43 factoid took 111 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (271 resets) in 424 ms. (94 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
// Phase 1: matrix 376 rows 464 cols
[2024-06-01 07:15:04] [INFO ] Computed 100 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 211/339 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/455 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 370/825 variables, 455/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/838 variables, 7/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/838 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/840 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/840 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/840 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 571 constraints, problems are : Problem set: 0 solved, 3 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 211/339 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 116/455 variables, 45/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 370/825 variables, 455/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/825 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 13/838 variables, 7/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/838 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/838 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/838 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/840 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/840 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/840 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 584 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 495 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 376/376 transitions.
Graph (complete) has 981 edges and 464 vertex of which 463 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 463 transition count 327
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 415 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 413 transition count 325
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 101 place count 413 transition count 225
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 318 place count 296 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 295 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 295 transition count 224
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 584 place count 156 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 585 place count 156 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 155 transition count 102
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 593 place count 155 transition count 102
Applied a total of 593 rules in 63 ms. Remains 155 /464 variables (removed 309) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 155/464 places, 102/376 transitions.
RANDOM walk for 40000 steps (3871 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1044 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16141 states, properties seen :0
Probabilistic random walk after 56429 steps, saw 16141 distinct states, run finished after 236 ms. (steps per millisecond=239 ) properties seen :0
Explored full state space saw : 16141 states, properties seen :0
Exhaustive walk after 56429 steps, saw 16141 distinct states, run finished after 217 ms. (steps per millisecond=260 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 44 factoid took 393 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Support contains 4 out of 464 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 376/376 transitions.
Graph (complete) has 981 edges and 464 vertex of which 463 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 462 transition count 326
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 414 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 412 transition count 324
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 101 place count 412 transition count 225
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 316 place count 296 transition count 225
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 580 place count 157 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 581 place count 157 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 583 place count 156 transition count 103
Applied a total of 583 rules in 43 ms. Remains 156 /464 variables (removed 308) and now considering 103/376 (removed 273) transitions.
// Phase 1: matrix 103 rows 156 cols
[2024-06-01 07:15:08] [INFO ] Computed 69 invariants in 1 ms
[2024-06-01 07:15:08] [INFO ] Implicit Places using invariants in 148 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 37, 38, 39, 40, 41]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 162 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/464 places, 103/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 136/464 places, 103/376 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/136 stabilizing places and 12/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 378 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (4024 resets) in 332 ms. (120 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (998 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (866 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (901 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
// Phase 1: matrix 103 rows 136 cols
[2024-06-01 07:15:09] [INFO ] Computed 49 invariants in 1 ms
[2024-06-01 07:15:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/117 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16/133 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 103/236 variables, 133/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/239 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 191 constraints, problems are : Problem set: 0 solved, 3 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 136/136 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/117 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16/133 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 103/236 variables, 133/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/239 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 136/136 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 25 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 103/103 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 102
Applied a total of 3 rules in 7 ms. Remains 135 /136 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 135/136 places, 102/103 transitions.
RANDOM walk for 40000 steps (4026 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (870 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16144 states, properties seen :0
Probabilistic random walk after 56442 steps, saw 16144 distinct states, run finished after 130 ms. (steps per millisecond=434 ) properties seen :0
Explored full state space saw : 16144 states, properties seen :0
Exhaustive walk after 56442 steps, saw 16144 distinct states, run finished after 108 ms. (steps per millisecond=522 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 9977 reset in 172 ms.
Product exploration explored 100000 steps with 10025 reset in 186 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 103/103 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 102
Applied a total of 2 rules in 4 ms. Remains 135 /136 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 135 cols
[2024-06-01 07:15:11] [INFO ] Computed 49 invariants in 2 ms
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 07:15:11] [INFO ] Invariant cache hit.
[2024-06-01 07:15:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [8, 11, 79, 81, 83, 85]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 277 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 102/103 transitions.
Graph (complete) has 383 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 117 transition count 96
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 5 place count 116 transition count 95
Applied a total of 5 rules in 5 ms. Remains 116 /129 variables (removed 13) and now considering 95/102 (removed 7) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-06-01 07:15:11] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 07:15:11] [INFO ] Invariant cache hit.
[2024-06-01 07:15:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:15:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/136 places, 95/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 591 ms. Remains : 116/136 places, 95/103 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 69589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(X(X((p1 U p2))))))))'
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 468 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 468 transition count 381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 464 transition count 377
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 464 transition count 377
Applied a total of 20 rules in 38 ms. Remains 464 /474 variables (removed 10) and now considering 377/387 (removed 10) transitions.
// Phase 1: matrix 377 rows 464 cols
[2024-06-01 07:15:12] [INFO ] Computed 99 invariants in 6 ms
[2024-06-01 07:15:12] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 07:15:12] [INFO ] Invariant cache hit.
[2024-06-01 07:15:12] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-06-01 07:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/464 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 108 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 4 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 30109ms, After SMT, problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 30112ms
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 377/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30691 ms. Remains : 464/474 places, 377/387 transitions.
Stuttering acceptance computed with spot in 510 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11
Stuttering criterion allowed to conclude after 2208 steps with 61 reset in 2 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 31229 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(p1) U X(p2)))))'
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 469 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 382
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 467 transition count 380
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 467 transition count 380
Applied a total of 14 rules in 19 ms. Remains 467 /474 variables (removed 7) and now considering 380/387 (removed 7) transitions.
// Phase 1: matrix 380 rows 467 cols
[2024-06-01 07:15:43] [INFO ] Computed 99 invariants in 2 ms
[2024-06-01 07:15:43] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 07:15:43] [INFO ] Invariant cache hit.
[2024-06-01 07:15:43] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-06-01 07:15:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/847 variables, and 229 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 130/229 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/349 constraints. Problems are: Problem set: 1 solved, 378 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 107 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 60154ms, After SMT, problems are : Problem set: 1 solved, 378 unsolved
Search for dead transitions found 1 dead transitions in 60158ms
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 : 467/474 places, 379/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 467 /467 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60762 ms. Remains : 467/474 places, 379/387 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 684 reset in 157 ms.
Stack based approach found an accepted trace after 12434 steps with 85 reset with depth 6 and stack size 6 in 25 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 61174 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(p1)&&p0))||G(p2)))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 467 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 467 transition count 380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 463 transition count 376
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 463 transition count 376
Applied a total of 22 rules in 17 ms. Remains 463 /474 variables (removed 11) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 463 cols
[2024-06-01 07:16:44] [INFO ] Computed 99 invariants in 3 ms
[2024-06-01 07:16:44] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:16:44] [INFO ] Invariant cache hit.
[2024-06-01 07:16:44] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-01 07:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 88 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/839 variables, and 222 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/463 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 55/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 123/222 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 1 ms to minimize.
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 376/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 463/474 places, 376/387 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-13
Product exploration explored 100000 steps with 678 reset in 156 ms.
Product exploration explored 100000 steps with 678 reset in 177 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 982 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 184 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (271 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (45 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2301 steps, run visited all 1 properties in 10 ms. (steps per millisecond=230 )
Probabilistic random walk after 2301 steps, saw 2053 distinct states, run finished after 16 ms. (steps per millisecond=143 ) properties seen :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 19 factoid took 128 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-14-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-13 finished in 61655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&X(X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (G(!p1)||X(G(p2)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLFireability-10
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0) p2)]
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 474/474 places, 387/387 transitions.
Graph (complete) has 1002 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 472 transition count 334
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 421 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 419 transition count 332
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 107 place count 419 transition count 231
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 326 place count 301 transition count 231
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 332 place count 295 transition count 225
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 295 transition count 225
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 598 place count 159 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 599 place count 159 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 601 place count 158 transition count 104
Applied a total of 601 rules in 31 ms. Remains 158 /474 variables (removed 316) and now considering 104/387 (removed 283) transitions.
// Phase 1: matrix 104 rows 158 cols
[2024-06-01 07:17:46] [INFO ] Computed 70 invariants in 2 ms
[2024-06-01 07:17:46] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 39, 40, 41, 42, 43]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 144 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 138/474 places, 104/387 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 178 ms. Remains : 138/474 places, 104/387 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 9931 reset in 207 ms.
Product exploration explored 100000 steps with 9936 reset in 253 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/138 stabilizing places and 12/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 613 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (3968 resets) in 327 ms. (121 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (982 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (879 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (912 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
// Phase 1: matrix 104 rows 138 cols
[2024-06-01 07:17:48] [INFO ] Computed 50 invariants in 1 ms
[2024-06-01 07:17:48] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/117 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/135 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 104/239 variables, 135/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/242 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 138/138 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/117 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/135 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 104/239 variables, 135/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/242 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/242 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 138/138 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 104/104 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 137 transition count 103
Applied a total of 3 rules in 8 ms. Remains 137 /138 variables (removed 1) and now considering 103/104 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 137/138 places, 103/104 transitions.
RANDOM walk for 40000 steps (3978 resets) in 488 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (998 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (861 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (901 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Probably explored full state space saw : 16144 states, properties seen :2
Probabilistic random walk after 56442 steps, saw 16144 distinct states, run finished after 115 ms. (steps per millisecond=490 ) properties seen :2
Explored full state space saw : 16144 states, properties seen :0
Exhaustive walk after 56442 steps, saw 16144 distinct states, run finished after 116 ms. (steps per millisecond=486 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 38 factoid took 957 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Support contains 4 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 07:17:50] [INFO ] Invariant cache hit.
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 07:17:51] [INFO ] Invariant cache hit.
[2024-06-01 07:17:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [8, 11, 21, 82, 84, 86, 88, 122]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 413 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/138 places, 104/104 transitions.
Graph (complete) has 386 edges and 130 vertex of which 119 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 118 transition count 98
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 5 place count 117 transition count 97
Applied a total of 5 rules in 5 ms. Remains 117 /130 variables (removed 13) and now considering 97/104 (removed 7) transitions.
// Phase 1: matrix 97 rows 117 cols
[2024-06-01 07:17:51] [INFO ] Computed 36 invariants in 3 ms
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 07:17:51] [INFO ] Invariant cache hit.
[2024-06-01 07:17:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/138 places, 97/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 660 ms. Remains : 117/138 places, 97/104 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/117 stabilizing places and 11/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 469 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (4025 resets) in 449 ms. (88 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (998 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (885 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (904 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
[2024-06-01 07:17:52] [INFO ] Invariant cache hit.
[2024-06-01 07:17:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/96 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/108 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/205 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 9/214 variables, 9/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/214 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/96 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/108 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/205 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 9/214 variables, 9/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 161 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 20 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 97/97 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 96
Applied a total of 2 rules in 3 ms. Remains 116 /117 variables (removed 1) and now considering 96/97 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 116/117 places, 96/97 transitions.
RANDOM walk for 40000 steps (4044 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (884 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Probably explored full state space saw : 7088 states, properties seen :0
Probabilistic random walk after 21620 steps, saw 7088 distinct states, run finished after 38 ms. (steps per millisecond=568 ) properties seen :0
Explored full state space saw : 7088 states, properties seen :0
Exhaustive walk after 21620 steps, saw 7088 distinct states, run finished after 66 ms. (steps per millisecond=327 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 733 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 10055 reset in 247 ms.
Product exploration explored 100000 steps with 10136 reset in 255 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 97/97 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 96
Applied a total of 2 rules in 4 ms. Remains 116 /117 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 116 cols
[2024-06-01 07:17:54] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 07:17:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 07:17:54] [INFO ] Invariant cache hit.
[2024-06-01 07:17:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:17:54] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-01 07:17:54] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-06-01 07:17:54] [INFO ] Invariant cache hit.
[2024-06-01 07:17:54] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 2/116 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Problem TDEAD26 is UNSAT
At refinement iteration 13 (OVERLAPS) 96/212 variables, 116/210 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 5/215 constraints. Problems are: Problem set: 1 solved, 92 unsolved
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 2/217 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 17 (OVERLAPS) 0/212 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 217 constraints, problems are : Problem set: 1 solved, 92 unsolved in 7264 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 1 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/116 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 60/96 constraints. Problems are: Problem set: 1 solved, 92 unsolved
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 11/107 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 96/212 variables, 116/223 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 5/228 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 92/320 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 320 constraints, problems are : Problem set: 1 solved, 92 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 92/93 constraints, Known Traps: 71/71 constraints]
After SMT, in 11423ms problems are : Problem set: 1 solved, 92 unsolved
Search for dead transitions found 1 dead transitions in 11426ms
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 SI_LTL mode, iteration 1 : 116/117 places, 95/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 07:18:06] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 11708 ms. Remains : 116/117 places, 95/97 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 20058 ms.
[2024-06-01 07:18:06] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:18:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:18:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 387 transitions and 1152 arcs took 6 ms.
Total runtime 450481 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-14-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226312386

--------------------
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
mcc2024
ltl formula name BusinessProcesses-PT-14-LTLFireability-01
ltl formula formula --ltl=/tmp/7429/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 474 places, 387 transitions and 1152 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7429/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7429/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7429/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7429/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 475 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 475, there are 444 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~136 levels ~10000 states ~98912 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~20000 states ~208824 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~40000 states ~446368 transitions
pnml2lts-mc( 1/ 4): ~136 levels ~80000 states ~927752 transitions
pnml2lts-mc( 1/ 4): ~136 levels ~160000 states ~1999704 transitions
pnml2lts-mc( 2/ 4): ~369 levels ~320000 states ~3679376 transitions
pnml2lts-mc( 2/ 4): ~369 levels ~640000 states ~8038680 transitions
pnml2lts-mc( 2/ 4): ~369 levels ~1280000 states ~17296072 transitions
pnml2lts-mc( 2/ 4): ~369 levels ~2560000 states ~36542200 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~289!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1734701
pnml2lts-mc( 0/ 4): unique states count: 2348222
pnml2lts-mc( 0/ 4): unique transitions count: 35331345
pnml2lts-mc( 0/ 4): - self-loop count: 163
pnml2lts-mc( 0/ 4): - claim dead count: 31869122
pnml2lts-mc( 0/ 4): - claim found count: 1102400
pnml2lts-mc( 0/ 4): - claim success count: 2348245
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1444
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2348252 states 35331494 transitions, fanout: 15.046
pnml2lts-mc( 0/ 4): Total exploration time 24.980 sec (24.960 sec minimum, 24.975 sec on average)
pnml2lts-mc( 0/ 4): States per second: 94005, Transitions per second: 1414391
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 19.8MB, 8.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 390 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 19.8MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-14-LTLFireability-10
ltl formula formula --ltl=/tmp/7429/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 474 places, 387 transitions and 1152 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7429/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7429/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7429/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7429/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 475 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 475, there are 612 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~597!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3127
pnml2lts-mc( 0/ 4): unique states count: 5081
pnml2lts-mc( 0/ 4): unique transitions count: 45616
pnml2lts-mc( 0/ 4): - self-loop count: 56
pnml2lts-mc( 0/ 4): - claim dead count: 26232
pnml2lts-mc( 0/ 4): - claim found count: 2467
pnml2lts-mc( 0/ 4): - claim success count: 5100
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1498
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5103 states 45721 transitions, fanout: 8.960
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.090 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46391, Transitions per second: 415645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 18.8 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 390 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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